PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2022 paper

Module 2: Fundamental Algorithmic Strategies

20222m

Kruskal algorithm is a
(i) Divide & conquer algorithm
(ii) Branch and bound algorithm
(iii) Greedy algorithm
(iv) Dynamic programming

Search GoogleAsk AI
Worked SolutionAI Assisted

Answer: (iii) Greedy algorithm

Explanation:

  • Kruskal's MST: sort edges by weight ascending, iterate adding smallest edge that does not form a cycle (using Union-Find). At each step it makes the locally optimal (minimum-weight) choice — the defining characteristic of the Greedy paradigm.
  • Similarly Prim's is also greedy.
  • Divide & conquer splits into independent subproblems (Merge Sort, Quick Sort). Dynamic programming solves overlapping subproblems. Branch-and-bound is for backtracking optimization.

Correct choice: (iii) Greedy algorithm

Similar questions

Design and Analysis of Algorithms In which algorithmic strategy are problems systematically divided into smaller subproblems until the solution to the original problem is found? (i) Brute-force (ii) Greedy (iii) Dynamic programming (iv) Backtracking20232mDesign & Analysis of AlgorithmsKruskal's Algorithm for finding the Minimum Spanning Tree of a graph is a kind of a? - (i) DP Problem - (ii) Greedy Algorithm - (iii) Adhoc Problem - (iv) None of the above20242mDesign and Analysis of Algorithms Which strategy solves problems by solving subproblems and combining their solutions? (i) Brute Force (ii) Greedy (iii) Dynamic Programming (iv) Backtracking20242mDesign & Analysis of AlgorithmsThe approach followed in Floyd Warshall's algorithm is - (i) Greedy approach - (ii) Dynamic approach - (iii) Backtracking - (iv) Divide and conquer20242m
PreviousWhich one of the following statement is correct? (i) If A \le_p B and B \in P then A \in P (ii) If A \le_p B and $A otin P then B otin P$ (iii) If A \le_p B and B \le_p C then A \le_p C (iv) All of theseNextSolve the following recurrence by successive substitution method: f(1) = 1 \quad \text{if } n=1 f(n) = 3f(n/2) + 6 \quad \text{if } n > 1
Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

Get on Google Play