Skip to content
Related Articles

Related Articles

Improve Article

UGC-NET | UGC NET CS 2016 July – III | Question 34

  • Last Updated : 24 Apr, 2018

Match the following:
35
(A) (1)
(B) (2)
(C) (3)
(D) (4)


Answer: (C)

Explanation:

  • Huffman codes takes O(nlgn) time.
  • Optimal polygon triangulation takes θ(n3) time

    Activity selection problem takes θ(n) time

  • Quicksort takes O(n2) time

So, option (C) is correct.


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :