1. PART B - (5 x 16 = 80 ma rka)
11. (a) Consider the shortest path problem for directed graphs in which tbe
length of a path is the number of edges in the path. It can be solved by
breadth-first search method. What actions should be performed br the
functions that "process" a vertex and an edge in order to actually
compute the shortest path from any stact vertex Vs to all other vertices
in the graph?
Or
(b) '¥rite the pseudo code of an algorithm for an exhaustive search by means
of back-tracking for the following travelling salesman problem. obtain the
search tree. '
12. (a) Name the algorithm proposed by Liao-Wong. Give out its distance
evolution graph with the pseudo code.
Or
(b) Write the steps involved in the application of Kernighan-Lin algorithm.
How does it perform the partitioning? Elaborate.
13. (a) Consider the floor plan that consists of four leaf cells. A, B, C and D. The
leaf cells are inset cells that can be rotated and mirrored. Theil'
dimensions are,
A: 2 x 2
B:lx3
C: 1 x 4
D: 2 x 4.
~ive .the shape ~unction~~f these cells. Compute the optimal shape of the
CIrCUltby applying the sizmg algorithm using the slicing tree.
Or
(b) Why do we say th~t the channel routing problem as NP-Compl~te? 'With
an example, explain the rotast channel touting algorithm and give out-its
results.
2 118'71