1) What do you mean by Dynamic Programming describe it with suitable.
2) describe Binomial Coefficient
3) What is Transitive closure?
4) What is Warshalls algorithm? Give suitable ex.
5) Describe All-pair shortest-paths problem.
6) Describe Floyd's algorithm in detail.
7) What does Floyd’s algorithm do?
8) Describe principle of Optimality.
9) Solve the all-pairs shortest path problem for the digraph with the weight matrix given below.
A B C D
A 0 ∞ ∞ 3
B 2 0 ∞ ∞
C ∞ 7 0 1
D 6 ∞ ∞ 0
10) State two reasons to terminate a search path at the current node in a state-space tree of a branch and bound algorithm.
11) Describe “Graph coloring” problem with suitable ex.