Computer Science · Design and Analysis of Algorithms
Match List-I (Graph Algorithms/Concepts) with List-II (Properties/Definitions): P. Bellman-Ford Algorithm Q. Prim's Algorithm R. Topological Sorting S. Floyd-Warshall Algorithm List-II: 1. A single-source shortest path algorithm that handles negative edge weights and detects negative cycles. 2. A graph algorithm that orders vertices of a Directed Acyclic Graph (DAG) linearly based on dependencies. 3. A minimum spanning tree algorithm that grows a single tree starting from an arbitrary vertex. 4. An all-pairs shortest path algorithm using dynamic programming.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1P-3, Q-1, R-4, S-2
- 2P-4, Q-3, R-1, S-2
- 3P-1, Q-3, R-2, S-4✓
- 4P-1, Q-3, R-4, S-2
Correct answer
P-1, Q-3, R-2, S-4
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 Design and Analysis of Algorithms MCQs →Want more practice questions on Design and Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Design and Analysis of Algorithms