Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

GATE | GATE-CS-2014-(Set-3) | Question 23

Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.


(A) 17
(B) 18
(C) 19
(D) 20

Answer: (C)
Explanation: The following diagram shows the worst case situation where the recursion tree has maximum depth.



So the recursion depth is 19 (including the first node).
Quiz of this Question



Article Tags :
GATE
Recommended Articles
1. GATE | GATE-CS-2014-(Set-1) | Question 1
2. GATE | GATE-CS-2014-(Set-1) | Question 2
3. GATE | GATE-CS-2014-(Set-1) | Question 3
4. GATE | GATE-CS-2014-(Set-1) | Question 4
5. GATE | GATE-CS-2014-(Set-1) | Question 5
6. GATE | GATE-CS-2014-(Set-1) | Question 6
7. GATE | GATE-CS-2014-(Set-1) | Question 7
8. GATE | GATE-CS-2014-(Set-1) | Question 65
9. GATE | GATE-CS-2014-(Set-1) | Question 65
10. GATE | GATE-CS-2014-(Set-1) | Question 65
11. GATE | GATE-CS-2014-(Set-1) | Question 11
12. GATE | GATE-CS-2014-(Set-1) | Question 65
13. GATE | GATE-CS-2014-(Set-1) | Question 13
14. GATE | GATE-CS-2014-(Set-1) | Question 65
15. GATE | GATE-CS-2014-(Set-1) | Question 15
16. GATE | GATE-CS-2014-(Set-1) | Question 16
17. GATE | GATE-CS-2014-(Set-1) | Question 65
18. GATE | GATE-CS-2014-(Set-1) | Question 18
19. GATE | GATE-CS-2014-(Set-1) | Question 19
20. GATE | GATE-CS-2014-(Set-1) | Question 20
21. GATE | GATE-CS-2014-(Set-1) | Question 21
22. GATE | GATE-CS-2014-(Set-1) | Question 22
23. GATE | GATE-CS-2014-(Set-1) | Question 23
24. GATE | GATE-CS-2014-(Set-1) | Question 25
25. GATE | GATE-CS-2014-(Set-1) | Question 65