教资会网络 | UGC NET CS 2018 年 7 月 – II |问题 27

和以下相符：

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) (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 Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here. Start Your Coding Journey Now!