Professional Documents
Culture Documents
04.11.2020
Important questions
1. Job sequencing with deadline using greedy method
2. Discuss about the minimum-cost spanning trees.
3. Explain about the optimal storage on tapes.
4. Explain optimal binary search trees(*) using dynamic programming
5. Explain 0/1 knapsack problem.
6. Explain in details about the techniques for binary trees.
7. Discuss about the connected components and spanning tree.
8. Discuss about the traveling sales person problem using dynamic
programming
9. Explain about multistage graph