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 | codes:
(A) (1) So, option (D) is correct. Improve your Coding Skills with PracticeStart Your Coding Journey Now! |