UNIT-1

1(a)

Define algorithm? What is analysis of algorithm? Give a suitable example.

6M

Outline different Pseudo code conventions for designing an algorithm with help of an example?

9M

2(a)

Derive the formulation of Space complexity and illustrate with an example.

6M

(b)

Derive the formulation of Time complexity and illustrate with an example.

9M

3(a)

Describe different Asymptotic notations, used for expressing time complexity.

7M

How to calculate performance of algorithms. Explain.

Construct a recursive Binary search algorithm and illustrate with an example, and trace the
control flow of execution.

8M

(b)

(b)
4(a)

10M

(b)

Analyze the time complexity of binary search.

5M

5(a)

Designs merge sort algorithm and instantiate with an example.

10M

(b)

Analyze the time complexity of merge sort.

Design an algorithm for finding maximum and minimum of a list of elements and illustrate with an
example.
Analyze time complexity of finding maximum and minimum.

5M
10M

7 (a)

Design control abstraction of divide and conquer strategy and list out the applications of divide
and conquer paradigm.

7M

(b)

Write an algorithm for matrix addition and calculate time complexity by using step count variable.

8M

6(a)
(b)

8(a)
(b)
9(a)

(b)
10

Design a recursive algorithm for factorial and calculate time complexity by using frequency
count.
Sort the elements 310,285,179,652,351,423,861,254,450,520 using merge sort algorithm and
draw the tree of calls of merge sort.
Perform binary search for an element 151 using divide and conquer approach on the following
list of elements. Trace the execution sequence.
-15,-6,0,7,9,23,54,82,101,112,125,131,142
Find the maximum and minimum element using divide and conquer strategy for the following
elements. Trace the execution sequence.
15,73,-9,-7,16,42,49,11,5,-1
Give control abstraction of divide and conquer and explain any one application of divide and
conquer algorithm with an example, emphasizing the salient features of the design.

5M

7M
8M
7M

8M
15M

UNIT-2
1(a)

Generalize the Control abstraction of greedy method, giving the details of design aspects.

7M

List out the differences between divide and conquer and greedy methods with respect to design.

8M

2(a)

State Knapsack problem and design an algorithm for finding the optimal solution.

8M

(b)

Find the optimal solution for a knapsack instance of n=3 ,m=20 (p 1,p2,p3)=(15,12,19)
(w1,w2,w3)=(20,15,10).

7M

(b)

3(a)

Elaborate the Procedure of tree vertex splitting.

Calculate tree vertex splitting for the following tree with delay of 5

6M

(b)

9M

4(a)

Design an algorithm for Job sequencing with deadlines using Greedy strategy.

(b)

Find an optimal sequence for the jobs n=4 (p 1,p2,p3,p4) =

deadlines(d1,d2,d3,d4)=(2,3,2,1). Trace the algorithm execution sequence.

(100,10,15,27)

7M
and

8M

5(a)

Design an algorithm for optimal storage on tapes and find all feasible solutions for n=3 and
(l1,l2,l3)=(5,10,3) and calculate optimal retrieval time.

9M

(b)

Find total retrieval time for the programs12,5,8,32,7,5,18,13 with single tape and three tapes

6M

Define Minimum cost spanning tree. Find the minimum cost spanning tree for the following graph
by using prims algorithm. Give the pseudo code for PRIMS algorithm and trace the execution
sequence.

6(a)

9M

(b)

Construct optimal merge pattern for the files 2,9,7,5,3,13 and show the corresponding steps
diagrammatically.

6M

7(a)

Find the Knap sack instance of n=7,m=15 (p 1,p2,p3,p4,p5,p6,p7)=(10,5,15,7,6,18,3) and

(w1,w2,w3,w4,w3,w6,w7)=(2.3.5.7.1.4.1) By using Greedy strategy obtain the solution.

8M

(b)

Find optimal sequence for the jobs n=4 (p 1,p2,p3,p4,p5) =(20,10,15,5,1) and deadlines
(d1,d2,d3,d4,d5)=(2,2,1,3.3) Trace the sequence of execution steps.
Design an algorithm for Single source shortest path problem by using Greedy strategy. Find the
shortest path to all the vertices from the source vertex v0 to all other vertices. Illustrate the
sequence of execution steps.

7M

15M

Construct minimum cost spanning tree of the following graph by using Kruskals algorithm. Trace
all the execution steps.

9(a)

b)

8M

Write an algorithm of optimal merge patterns explain with an example of

2,5,7,26,11,16,21,17,35,42
Construct minimum cost spanning tree of the following graph by using both prims and Kruskals
algorithm. Briefly compare both methods.

10

7M

15M

UNIT-3

1(a)

Define Principle of optimality and List out the differences between Greedy Heuristic method and
dynamic programming method.
Find the shortest path from source (s) to destination (t) by using multistage graph for the
following example. Show all the steps to solve the recurrence relation formation of the
corresponding dynamic programming.

(b)

6M

9M

Design an algorithm for All pairs of shortest path and calculate shortest path between all pairs of
vertices by using dynamic programming method for the following graph.

15M

Write the procedure of single source shortest path to all destinations and solve the example by
using dynamic programming method.

15M

4(a)

What is optimal binary search tree .Design an algorithm for optimal binary search tree using
dynamic programming method.

5M

(b)

Draw the optimal binary search tree for n=4 (a1,a2,a3,a4)=(do, if, int, while) and P[1:4]=(3,3,1,1)
Q[0:4]=(2,3,1,1,1)

10M

5(a)

State and elaborate 0/1 Knapsack problem solution by dynamic programming method.

6M

(b)

Find knapsack instance of m=21,n=4and Pi=(2,5,8,1) and Wi=(10,15,6,9) by using Dynamic

Programming.

9M

6(a)

Describe the procedure of Reliability design.

6M

(b)

Design a three stage system with device types d1,d2,d3 .The costs are 30/-,15/-,20/- and the
cost of entire system is 105/- and the reliabilities are 0.9,0.8,0.5.

9M

Describe the procedure of Travelling sales person problem and find optimal tour for the following
cost matrix, using dynamic programming method.

15M

Design an algorithm for All pairs of shortest path and calculate shortest path between all pairs of
vertices by using dynamic programming method for the following graph

15M

Find the solution for knapsack instance for n=5,m=11 P i=(5,4,7,2,3) Wi=(4,3,6,2,2) by using
Dynamic programming.
Find an optimal tour for the following graph using dynamic programming.(TSP)

10

15M

15M

UNIT-4
1
2(a)

Construct the algorithms for different tree traversal techniques. And explain different traversals
by considering an example.

15M

Design an algorithm for Breadth first search.

7M

Identify the Breadth first traversal sequence of vertices for the following graph.

(b)

8M

3(a)

Design an algorithm for Depth first search.

7M

(b)

Identify the Depth first traversal sequence of vertices for the following graph.

8M

Design an algorithm for Sum of subsets problem. Draw the portion of the state space tree for
m=31 and w={7,11,13,24} for finding solution for sum of subsets using back tracking search
method.
Design a backtracking search algorithm for N-queens Problem. Find the positions of 4 queens
on a 4X4 chessboard.

4
5
6 (a)

Design a backtracking search algorithm for graph coloring problem.

15M
15M
7M

Construct the state space tree for the given graph with n=3 colors , and trace the backtracking
search method.
(b)

7(a)

8M

Design a backtracking search algorithm for Hamilton cycle determination problem.

7M

Draw the state space tree for the graph to find Hamilton cycles, when the search algorithm is
applied.
(b)

8M

Solve 0/1 knapsack problem using backtracking search method and draw the state space tree
generated for n=4 ,m=16 and P(1:4)=(40,30,50,10) and w(1:4)=(2,5,10,5).Also give the
sequences of search operations.

8
9(a)

Define the term Articulation point and explain the procedure for identifying articulation points of a
given graph.
Find articulation points for the following graph and draw different Bi-connected components.

(b)

15M
7M

8M

10(a)

Draw the portion of the state space tree for m=30 and W[1..6]={5,10,12,13,15,18} sum of
subsets problem instance when solved using back tracking search method..

8M

(b)

Draw the portion of the state space tree for 0/1 knapsack problem for n=4, m=62
W=[20,25,15,35] and P=[40,49,25,60]

7M

UNIT-5
1(a)
(b)

Generalize an algorithm for branch and bound. Compare and contrast FIFO and LC Branch
and Bound techniques.

10M

List out the differences between Branch and Bound and Backtracking.

5M

State 0/1 knapsack problem and design an algorithm ofLC Branch and Bound and find the
solution for the knapsack instance of n = 4; (pi, p2, p3, p4) = (10, 10, 12, 18); (w1. w2, w 3, w4) =
(2, 4, 6, 9) and M = 15.

15M

State 0/1 knapsack problem and apply FIFO Branch and Bound algorithm for the knapsack
instance of n = 4; (pi, p2, p3, p4) = (10, 10, 12, 18); (wi. w2, w 3, w4) = (2, 4, 6, 9) and M = 15.

15M

State Travelling salesperson problem. Apply Branch and Bound algorithm to solve the TSP
instantiated by the following cost matrix.

15M

5(a)

Define P, NP, and NP- Complete classes of problems.

6M

(b)

Explain 1.CNF SAT problem

2.Clique cover Problem.
3.Set cover problem

9M

Elaborate the P and NP Class of problems and give an example for each.

15M

7(a)

What are the properties of NP-Complete and NP Hard problems?

8M

(b)

State Cooks theorem. And its importance.

7M

Draw the portion of the state space tree generated by LCBB for the following instances
n = 5, (p1,p2,p3,p4,p5) = (10, 15,6,8,4); (w1,w2,w3,w4,w5) = (4,6,3,4,2) and m = 12. Of 0/1
knapsack problem

State NP Hard graph problem. And explain

a. The Clique decision problem
b. Node Cover decision problem
c. The Chromatic number decision problem

15M

15M

Consider the travelling sales person instance defined by the cost matrix

10

15M
a) Obtain the reduced cost matrix.
b) Draw the state space tree that will be generated by Least cost Branch and Bound
search..