UGC NET JRF November 2020 Paper-2
November 28, 2023Question 13878 – UGC NET JRF November 2020 Paper-2
November 28, 2023UGC NET JRF November 2020 Paper-2
|
Question 21
|
Let G be a simple undirected graph, TDbe a DFS tree on G, and TB be the BFS tree on G. Consider the following statements.
Statement I: No edge of G is a cross with respect to TD
Statement II: For every edge (u,v) of G, if u is at depth i and v is at depth j in TB then |i-j|=1
In the light of the above statements, choose the correct answer from the options given below
Statement I: No edge of G is a cross with respect to TD
Statement II: For every edge (u,v) of G, if u is at depth i and v is at depth j in TB then |i-j|=1
In the light of the above statements, choose the correct answer from the options given below
|
Both Statement I and Statement II are true
|
|
|
Both Statement I and Statement II are false
|
|
|
Statement I is correct but Statement II is false
|
|
|
Statement I is incorrect but Statement II is true
|
Question 21 Explanation:
I. TRUE: Undirected graphs do not have cross edges in DFS. But can have cross edges in directed graphs.
II. FALSE: Just draw a triangle ABC. Source is A. Vertex B and C are at the same level at distance 1. There is an edge between B and C too. So here |i – j| = |1 – 1| = 0.
II. FALSE: Just draw a triangle ABC. Source is A. Vertex B and C are at the same level at distance 1. There is an edge between B and C too. So here |i – j| = |1 – 1| = 0.
Correct Answer: C
Question 21 Explanation:
I. TRUE: Undirected graphs do not have cross edges in DFS. But can have cross edges in directed graphs.
II. FALSE: Just draw a triangle ABC. Source is A. Vertex B and C are at the same level at distance 1. There is an edge between B and C too. So here |i – j| = |1 – 1| = 0.
II. FALSE: Just draw a triangle ABC. Source is A. Vertex B and C are at the same level at distance 1. There is an edge between B and C too. So here |i – j| = |1 – 1| = 0.