Computer Science · Algorithms
Match the following greedy/graph algorithms with their correct functions: (A) Floyd-Warshall — (i) Shortest path between two vertices (B) Dijkstra — (ii) Single-source shortest path (C) Kruskal's — (iii) Minimum Spanning Tree (D) Bellman-Ford — (iv) All-pairs shortest path
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A)-(ii), (B)-(iii), (C)-(i), (D)-(iv)
- 2(A)-(i), (B)-(ii), (C)-(iii), (D)-(iv)
- 3(A)-(iv), (B)-(ii), (C)-(iii), (D)-(ii)✓
- 4(A)-(iii), (B)-(ii), (C)-(iv), (D)-(i)
Correct answer
(A)-(iv), (B)-(ii), (C)-(iii), (D)-(ii)
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