Computer Science · Algorithms
Which of the following algorithms can be considered as extensions or variants fundamentally related to the Breadth-First Search (BFS) strategy on unweighted or weighted graphs? A. Prim's algorithm B. Kruskal's algorithm C. Dijkstra's algorithm D. Greedy Best-First Search algorithm E. Dynamic Programming Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A and C only✓
- 2D and E only
- 3A, C and D only
- 4A and B 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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms