Question 26
Let G be a graph. The size of the minimum vertex cover of G is 12 and the size of the maximum independent set of G is 17. What are the number of the vertices in graph G?
Question 26: Let G be a graph. The size of the minimum vertex cover o…
Show answer
Correct answer: 29
Question 26 of 26 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 3 Sept 2023, in the May 2023 term (IIT M DIPLOMA ET1 EXAM QPD1 S2 03 Sep). It carries 3 marks.
More questions from this paper
- Figure question
- Which of the following statement(s) is/are true?
- Figure question
- Which of the following sorting algorithms will have the same time complexity irrespective of the sequence of elements i…
- Which of the following statement(s) is/are correct with regard to the given Selection Sort? 1. Selection sort is stable…
- Figure question
- Figure question
- An airline serves 1000 cities and runs 4500 direct flights each day between these cities. Which of the following is a g…
- Consider the following graph If Dijkstra algorithm is used with A as the source vertex then what is the order in which …
- The post-order traversal of a binary search tree with integer values produces the following sequence: 7, 5, 14, 12, 10,…
- If we do not maintain the height of subtrees at each node in an AVL tree, then what will be the upper bound of running …
- Figure question
- Figure question
- Figure question
- Figure question
- Figure question
- Figure question
- Consider the following DAG How many possible topological orderings are there for the given DAG ?
- Consider the graph G given below. The number of minimum cost spanning tree for the given graph is.
- In a binary tree T of 25 nodes, if the number of nodes with two children is 6, then the number of nodes with one child …
- Figure question
- Figure question
- Figure question
- Figure question
- Figure question