GATE CS 2015 Set 2 — Question 47
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+2 / -0.67EasyDijkstra's AlgorithmGraph AlgorithmsAlgorithmsFloyd-WarshallDynamic ProgrammingBinary Search (D&C)Divide & ConquerDFS TraversalGraphs (Data Structure)Programming & Data Structures
Algorithms → Divide & Conquer → Binary Search (D&C)
Last updated
Question
Given below are some algorithms, and some algorithm design paradigms.
Match the above algorithms on the left to the corresponding design paradigm they follow.
| Algorithm | Design Paradigm |
|---|---|
| 1. Dijkstra's Shortest Path | i. Divide and Conquer |
| 2. Floyd-Warshall algorithm to compute all pairs shortest path | ii. Dynamic Programming |
| 3. Binary search on a sorted array | iii. Greedy design |
| 4. Backtracking search on a graph | iv. Depth-first search |
| v. Breadth-first search |
Correct answer
(C) 1-iii, 2-ii, 3-i, 4-iv
Solution
1.Dijkstra's Shortest Path: Uses a Greedy approach (always picking the closest unvisited node). Matches with (iii).
2.Floyd-Warshall: Uses Dynamic Programming to compute all-pairs shortest paths ( based on ). Matches with (ii).
3.Binary Search: Uses Divide and Conquer (halving the search space). Matches with (i).
4.Backtracking search: Typically implemented using Depth-first search (exploring one branch as deep as possible before backtracking). Matches with (iv).
Correct matching: 1-iii, 2-ii, 3-i, 4-iv.Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Divide & Conquer
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 1 Q17Consider the following recurrence relations: For all ,…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 2 Q24Consider the following functions, where is a positive integer.…