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

Match the following:


List – I List – 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
(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)


  • 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
    Article Tags :

    Be the First to upvote.

    Please write to us at to report any issue with the above content.