some questions

13. What is dynamic programming? What is the difference between greedy method and dynamic programming?
14. Write and explain the algorithm for greedy strategies for the knapsack problem.
15. Write the algorithm for BFS and DFS.
16. Describe the problem of OBST as dynamic programming.
17. What is the bounding function for subset problem?
18. Describe the travelling salespersons problem.
19. Describe the sum of subset problem.
20. Describe the 8 queen’s problem using backtracking method.
21. What do you know by graph coloring? Give the algorithm for graph coloring using backtracking method.
22. Write down and explain the algorithm for finding all m-colorings of a graph.
23. Define explicit and implicit constrains.
24. Differentiate between backtracking and branch & bound algorithm techniques.
25. What do you mean by LC search?