Match the LIST-I with LIST-II LIST-I (Algorithm Design) LIST-II…

2026

Match the LIST-I with LIST-II

LIST-I (Algorithm Design)

LIST-II (Application/Problem)

A. Dynamic programming

I. Floyd Warshall Shortest path

B. Greedy

II. Huffman coding

C. Back tracking

III. Hamiltonian cycle problem

D. Branch and bound

IV. Travelling salesman (TSP) using lower bound

Choose the correct answer from the options given below:

  1. A-II, B-III, C-IV, D-I

  2. A-IV, B-III, C-II, D-I

  3. A-I, B-II, C-III, D-IV

  4. A-III, B-IV, C-I, D-II

  1. A.

    1

  2. B.

    2

  3. C.

    3

  4. D.

    4

Attempted by 32 students.

Show answer & explanation

Correct answer: C

Explanation

The correct matching of algorithm design techniques with their applications is as follows:

  • Dynamic programming (A) is used for Floyd Warshall Shortest path (I) to solve all-pairs shortest path problems.

  • Greedy algorithms (B) are ideal for Huffman coding (II) to create optimal prefix codes.

  • Backtracking (C) is commonly applied to the Hamiltonian cycle problem (III) for finding paths in graphs.

  • Branch and bound (D) is used for Travelling salesman (TSP) using lower bound (IV) for optimization.

Thus, the correct combination is A-I, B-II, C-III, D-IV.

Explore the full course: Coding For Placement