Skip to content
Related Articles

Related Articles

Improve Article
UGC-NET | UGC NET CS 2017 Jan – III | Question 36
  • Last Updated : 02 Apr, 2018

Match the following with respect to algorithm paradigms :
36
(A) (1)
(B) (2)
(C) (3)
(D) (4)


Answer: (D)

Explanation:

  1. Merge sort is a Divide and conquer algorithm
  2. Huffman coding is a Greedy approach
  3. Optimal polygon triangulation is Dynamic programming algorithm
  4. Subset sum problem is a Back tracking algorithm

    So, option (D) is correct.


    Quiz of this Question

    My Personal Notes arrow_drop_up
Recommended Articles
Page :