Question 4435 – 2010 December UGC NET Paper 1
December 4, 2023
Question 4462 – 2010 December UGC NET Paper 1
December 4, 2023
Question 4435 – 2010 December UGC NET Paper 1
December 4, 2023
Question 4462 – 2010 December UGC NET Paper 1
December 4, 2023

Question 9777 – Data-Structures

Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r,u) and d(r,v) be the lengths of the shortest paths from r to u and v respectively in G. If u is visited before v during the breadth-first traversal, which of the following statements is correct?

Correct Answer: C

Question 36 Explanation: 
d(r,u) and d(r, v) will be equal when u and v are at same level, otherwise d(r,u) will be less than d(r,v).
A
d(r,u)<d(r,v)
B
d(r,u)>d(r,v)
C
d(r,u)≤d(r,v)
D
None of the above

Leave a Reply

Your email address will not be published. Required fields are marked *