Millionaire Mode

Test 2 Algorithms | Computer Science

Question 1 of 20

Let T be a depth first search tree in an undirected graph G. Vertices u and n are leaves of this tree T.

The degrees of both u and n in G are at least 2. Which one of the following statements is true?

  1. There must exist a vertex w adjacent to both u and n in G.
  2. There must exist a vertex w whose removal disconnects u and n in G.
  3. There must exist a cycle in G containing u and n.
  4. There must exist a cycle in G containing u and all its neighbours in G.

Prize Money

15₹7 Crores
14₹1 Crore
13₹50,00,000
12₹25,00,000
11₹12,50,000
10₹6,40,000
9₹3,20,000
8₹1,60,000
7₹80,000
6₹40,000
5₹20,000
4₹10,000
3₹5,000
2₹2,000
1₹1,000