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

Programming, Data Structures and Algorithms using Python · Quiz 1 · 29 Oct 2023 · September 2023 term

Question 11: Suppose we obtain the following DFS tree rooted at node …

Question 11

+4 marksOne or more correct options

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

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

Select all that apply.

A
(A, K)
B
(H, J)
C
(M, N)
D
(B, O)
E
(P, E)
F
(C, M)

Show answer

Correct answers

B
(H, J)
C
(M, N)
E
(P, E)

See the whole paper Take it as a mock test

Question 11 of 15 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 1 paper sat on 29 Oct 2023, in the September 2023 term (IIT M DIPLOMA AN2 EXAM QPD2 29 Oct 2023). It carries 4 marks.

Question 11: Suppose we obtain the following DFS tree rooted at node …

Question 11

More questions from this paper