Quiz Space

Advanced Algorithms · End Term · 31 Aug 2025 · May 2025 term · Set QIA1

Question 20: Recall that the size of an optimal vertex cover is at mo…

Question 20

+2 marksOne correct option

Answer the given subquestions.

Recall that the size of an optimal vertex cover is at most twice the size of a maximum matching of a graph G. Are there examples of graphs where the size of the optimal vertex cover is exactly equal to twice the size of its maximum matching? For example, this is not true for a path on three vertices: the size of both the maximum matching and minimum vertex cover is 1.

  1. A

    Yes

  2. B

    No

Show answer

Correct answer

  • A

    Yes

See the whole paperTake it as a mock test

Question 20 of 21 in the IIT Madras BS Advanced Algorithms (Advanced Algorithms) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M IMPROVEMENT FN EXAM QIA1 31 Aug 2025). It carries 2 marks.

This question was also asked in

More questions from this paper

  1. Q1In this problem you are given as input a graph T = (V, E) that is a tree (that is, T is undirected, connected, and acyc…
  2. Q2Consider the task of counting how many sequences of length n exist consisting only of numbers 0, 1, and 2 such that eac…
  3. Q3Consider the task of counting how many sequences of length n exist consisting only of numbers 0, 1, and 2 such that eac…
  4. Q4Consider the task of counting how many sequences of length n exist consisting only of numbers 0, 1, and 2 such that eac…
  5. Q5Consider the task of counting how many sequences of length n exist consisting only of numbers 0, 1, and 2 such that eac…
  6. Q6Consider the task of counting how many sequences of length n exist consisting only of numbers 0, 1, and 2 such that eac…
  7. Q7Figure question
  8. Q8Choose the correct options:
  9. Q9Figure question
  10. Q10Consider the following instance of Set Cover problem: Universe \mathcal{U} = {a, b, c} Family \mathcal{F} = {S_1 = {a, …
  11. Q11Consider the following instance of Set Cover problem: Universe \mathcal{U} = {a, b, c, d} Family \mathcal{F} = \left{S_…
  12. Q12Consider the following instance of Set Cover problem: Universe \mathcal{U} = {a, b, c, d} Family \mathcal{F} = \left{S_…
  13. Q13In the MIN-2-SAT problem, we are given a 2-CNF formula \phi and an integer k, and the objective is to decide whether th…
  14. Q14The worst-case running time and expected running time are equal to within constant factors for any randomized algorithm.
  15. Q15An adversary can provide randomized quicksort with an input array of length n that forces the algorithm to run in \omeg…
  16. Q16Every linear program has a unique optimal solution.
  17. Q17Recall that in the vertex cover problem,we are trying to find a smallest subset S of vertices in a graph G such that G …
  18. Q18Consider the algorithm in the previous question no 18. Does the algorithm always output an optimal vertex cover?
  19. Q19Consider the algorithm in the previous question no 18. Does the algorithm always output a 2- approximate vertex cover?
  20. Q21Figure question