(a) How does dynamic programming relate with divide and conquer approach? (b) Does greedy algorithm always achieve optimal solution? If not, when…
(a) How does dynamic programming relate with divide and conquer approach?
(b) Does greedy algorithm always achieve optimal solution? If not, when does greedy approach achieve optimal solution?
From the BPSC Assistant Programmer (CSE) July 2023 – Written exam, question 5 of 8.
More from this paper
- Previous: (a) How does a compiler handle comments in source code? (b) What is the difference between sizeof c+1 and sizeof (c+1)?
- Next: (a) Compare array and linked list with necessary diagram. (b) Draw a binary tree of 15 elements in (a) Preorder (b) In-order (c) Post…
- All questions in BPSC Assistant Programmer (CSE) July 2023 – Written