Computer Science · Algorithms
Match the following algorithms with their correct algorithm design paradigms or core concepts: 1. Dijkstra's shortest path algorithm — (a) Greedy design 2. Floyd-Warshall's all-pairs shortest path algorithm — (b) Divide and conquer 3. Kruskal's algorithm — (c) Dynamic programming 4. Merge Sort algorithm — (d) Minimum spanning tree
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 11 – (b), 2 – (c), 3 – (a), 4 – (d)
- 21 – (a), 2 – (c), 3 – (d), 4 – (b)✓
- 31 – (c), 2 – (b), 3 – (a), 4 – (b)
- 41 – (a), 2 – (b), 3 – (c), 4 – (d)
Correct answer
1 – (a), 2 – (c), 3 – (d), 4 – (b)
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