DAA
UNIT 3
- Difference between dynamic programming and greedy method.
- Difference between dynamic programing and divide and conquer.
- Explain principle of optimality with 0/1 knapsack problem.
- Explain travelling salesman problem with example.
- What is optimal binary search tree explain with optimality.
- Difference between binary search tree and optimal binary search tree.
- How to solve warshal’s algorithm.
- Explain Floyd’s algorithm and give example.
- Explain all pair shortest path algorithm with example.
- Find transitive closure of given directed graph.
0 1 0 0
0 0 1 0
1 0 0 1
0 0 0 0
11. What is transitive closure explain with example.
12. Solve travelling salesman problem using dynamic programing.
0 1 1 56
2 0 7 3
9 6 0 12
10 4 8 0
0 matching results found