Planning to take coaching on https://unacademy.com/
here is a code for 10% off PLUS1BPK1
Downloads resources from here
https://education4fun.com/gate-cse/
MCQ (Single Correct Answer)
GATE CSE 2006
Let T be a depth first search tree in an undirected graph G. Vertices u and v are leaves of this tree T. The degrees of both u and v in G are at least 2. which one of the following statements is true?
A) There must exist a vertex w adjacent to both u and v in G
B) There must exist a vertex w whose removal disconnects u and v in G
C) There must exist a cycle in G containing u and v
D) There must exist a cycle in G containing u and all its neighbours in G.
