Match the LIST-I with LIST-II LIST-I LIST-II A. Dijkstra's Algorithm I. GPS…
2026
Match the LIST-I with LIST-II
LIST-I | LIST-II |
A. Dijkstra's Algorithm | I. GPS route finding |
B. Huffman Coding | II. Data compression |
C. KMP string matching | III. Text editor search function |
D. Ford-Fulkerson | IV. Network bandwidth optimization |
Choose the correct answer from the options given below:
- A.
A-II, B-IV, C-I, D-III
- B.
A-I, B-II, C-III, D-IV
- C.
A-IV, B-II, C-III, D-I
- D.
A-IV, B-III, C-II, D-I
Attempted by 19 students.
Show answer & explanation
Correct answer: B
Dijkstra's Algorithm finds shortest paths, matching GPS route finding (I). Huffman Coding compresses data, aligning with II. KMP string matching handles text search functions (III). Ford-Fulkerson optimizes network bandwidth via maximum flow (IV). Thus, the correct mapping is A-I, B-II, C-III, D-IV.