UTpaper

Free mock tests & test series

Question 112Asked in BEL PE Computer Science, 20 Dec 2025 (5:00 PM)

Consider a DFS on a graph with vertices {A, B, C, D, E}. If the traversal starts at A and discovers vertices in order A → B → C → D → E, what is the DFS…

Consider a DFS on a graph with vertices {A, B, C, D, E}. If the traversal starts at A and discovers vertices in order A → B → C → D → E, what is the DFS finishing order?
  1. ARandom order
  2. BE, D, C, B, A
  3. CA, B, C, D, E
  4. DD, E, C, B, A
Show answerHide answer

Correct answer: (B) E, D, C, B, A

From BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM)

This is question 112 of BEL PE Computer Science PYQ, 20 Dec 2025 (5:00 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.