UGC-NET | UGC NET CS 2017 Jan – III | Question 36
Match the following with respect to algorithm paradigms :
(A) (1)
(B) (2)
(C) (3)
(D) (4)
Answer: (D)
Explanation:
- Merge sort is a Divide and conquer algorithm
- Huffman coding is a Greedy approach
- Optimal polygon triangulation is Dynamic programming algorithm
- Subset sum problem is a Back tracking algorithm
So, option (D) is correct.