Ada Imp
Ada Imp
Ada Imp
UNIT 3
UNIT 4
1) What is Backtracking.
2) Explain Recursive and non-recursive backtracking.
3) Explain stste space tree.
4) Explain 4-queen's problem using backtracking. A=1
5) Explain 8-queen's problem using backtracking.
6) Explain graph coloring problem.
7) Explain backtracking for graph colouring problem.
8) Explain branch and bound method.
9) Traveling Salesperson problem.
10) Salesperson Reduced Cost Numerical. (VVI)
11) Branch and bound numerical.
12) Explain lower bound theory.
13) Explain parallel algorithm with example.
UNIT 5 Tree