Match the following.
2021
Match the following.
- A.
1-iv, 2-i, 3-ii, 4-iii
- B.
1-iii, 2-ii, 3-iv, 4-i
- C.
1-iv, 2-iii, 3-i, 4-ii
- D.
1-iii, 2-iv, 3-iii, 4-i
Attempted by 130 students.
Show answer & explanation
Correct answer: C
Step 1: The Longest Common Subsequence problem is solved using dynamic programming. This is because it involves overlapping subproblems and optimal substructure, which are key characteristics of dynamic programming.
Step 2: Huffman code uses a greedy approach to build an optimal prefix code based on character frequencies.
Step 3: Quick sort is a divide and conquer algorithm that recursively divides the array into smaller subarrays.
Step 4: Simplex algorithm is used for linear programming problems, which involve optimizing a linear objective function subject to linear constraints.