DESIGN AND ANALYSIS OF ALGORITHMS
PART A
Two Marks:-
2.Write short notes on backtracking?
3.Define state space tree?
4.State the principle behind dynamic programming?
5.Write down the algorithm for all-pair shortest path?
PART B
1.Explain about Travelling salesman problem and obtain optimal tour cost ?
2. Describe Backtracking solution to solve 8-queen problem?
3.Let M=31 And W={7,11,13,24},Draw apportion of state space tree and find Sum of subset?
0 comments:
Post a Comment