Skip to content
Related Articles

Related Articles

Improve Article

UGC-NET | UGC NET CS 2018 July – II | Question 27

  • Last Updated : 06 Sep, 2018



Match the following:

List – IList – II
(a) The 8-Queen’s problem(i)Dynamic programming
(b) Single-Source shortest paths(ii) Divide and conquer
(c)STRASSEN’s Matrix multiplication(iii)Greedy approach
(d)Optimal binary search trees(iv)Backtracking

codes:

(a)(b)(c)(d)
(1)(iv)(i)(iii)(ii)
(2)(iv)(iii)(i)(ii)
(3)(iii)(iv)(i)(ii)
(4)(iv)(iii)(ii)(i)


(A) (1)
(B) (2)
(C) (3)
(D) (4)


Answer: (D)

Explanation:

  • The 8-Queen’s problem is a Backtracking algorithm.
  • Single-Source shortest paths is a Greedy approach
  • STRASSEN’s Matrix multiplication is a Divide and conquer
  • Optimal binary search trees is a Dynamic programming.

    So, option (D) is correct.

    Quiz of this Question

    My Personal Notes arrow_drop_up
    Recommended Articles
    Page :