Computer Science · Graph Theory
Consider the task of finding the shortest path between two nodes in an unweighted graph using Breadth-First Search (BFS) and Depth-First Search (DFS). Which of the following statements are true? (A) BFS always finds the shortest path. (B) DFS always finds the shortest path. (C) DFS does not guarantee finding the shortest path. (D) BFS does not guarantee finding the shortest path.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(C) and (D) only
- 2(A) and (B) only
- 3(A) and (C) only✓
- 4(B) and (D) only
Correct answer
(A) and (C) only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Theory MCQs →Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Theory