Question 27
27. Match the following with respect to algorithm paradigms :
Code :| 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) | (ii) | (i) |
| (4) | (iv) | (iii) | (ii) | (i) |
Answer: (4)
| Previous | Next |
| UGC NET CS 2018 July - II Question 26 | UGC NET CS 2018 July - II Question 28 |