18

19

20

a)

a)

b)
a)
b)
0)

17192010

Pages:4

Define Travelling Salesman Problem (TSP). Explain the basic steps that are to

be followed to solve TSP using branch and bound with an example.

Write the Kruskal’s algorithm for finding minimum cost spanning tree and explain

the Kruskal’s algorithm with an example. Analyse the complexity of the algorithm.

Explain greedy strategy

State and explain N-queens problem

Draw the state space tree of 4-queens problem

Define backtracking strategy

Page 4 of 4

(10)

(7)

(3)
(2)
(5)
(3)