Suppose we obtain the following BFS tree rooted at node G for an undirected graph with vertices {A, B, C, D, E,F, G, H, I, J, K}. Figure from the original question paper Which of the following can not be an edge/edges in the original graph?

(A) Option figure from the original question paper

(B) Option figure from the original question paper

(C) Option figure from the original question paper

(D) Option figure from the original question paper

(E) Option figure from the original question paper

Programming, Data Structures and Algorithms using Python · End Term · 13 Apr 2025 · January 2025 term · Set QDD1

Question 16: Suppose we obtain the following BFS tree rooted at node …

Question 16

+4 marksOne or more correct options

Suppose we obtain the following BFS tree rooted at node G for an undirected graph with vertices {A, B, C, D, E,F, G, H, I, J, K}.

Which of the following can not be an edge/edges in the original graph?

Select all that apply.

Show answer

Correct answers

See the whole paper Take it as a mock test

Question 16 of 25 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 13 Apr 2025, in the January 2025 term (IIT M DIPLOMA AN EXAM QDD3 13 Apr 2025). It carries 4 marks.

Question 16: Suppose we obtain the following BFS tree rooted at node …

Question 16

More questions from this paper