NTK/KW/15/7441

Faculty of Engineering & Technology

Fifth Semester B.E. (Computer Science Engg.)
(C.B.S.) Examination
DESIGN AND ANALYSIS OF ALGORITHMS

Time : Three Hours] [Maximum Marks : 80

INSTRUCTIONS TO CANDIDATES
(1) All questions carry marks as indicated.
(2) Solve SIX questions as follows :
Que. No. 1 OR Que. No. 2
Que. No. 3 OR Que. No. 4
Que. No. 5 OR Que. No. 6
Que. No. 7 OR Que. No. 8
Que. No. 9 OR Que. No. 10
Que. No. 11 OR Que. No. 12
(3) Due credit will be given to neatness and
adequate dimensions.
(4) Illustrate the answers with necessary figures/
drawings wherever necessary.

1. (a) Solve the following recurrence

1 if n = 1
tn =  5
2 T( n / 2) + n otherwise .

MVM—47101 1 (Contd.)
www.rtmnuonline.com

(b) Solve non homogenous recurrence : 4. (a) What are different asymptotic notations ? Explain
them briefly. For the following equation find values
T(n) = n if n=0 or n = 1
of constant using various approaches :
= st(n – 1) – 6n otherwise. 5
(i) 3n + 2
(c) Define algorithm. Explain the characteristics of
algorithm. 4 (ii) 10n2 + 4n + 2 7
OR (b) Implement insertion sort on following array :

2. (a) Using master method, solve the following 18, 12, 44, 64, 76, 15, 129, 20.
recurrence and also find the values of constant Write recursive algorithm. 6
involved :
5. (a) Explain the difference between Greedy and Divide
T(n) = T(n/4) + n + 4 for n ≥ 4 and T(1) = 4.
and Conquer method of algorithm design. 4
7
(b) For the following sequence of objects find the
2 if n=0 profit by three method capacity = 30, Number of
(b) tn =  4
3t n − 1 + n + 2
n
otherwise . objects = 07
Object Weight Profit
(c) State the difference between recursive and iterative
method. 3 1 4 20

3. (a) Implement Biotonic sorting network for following 2 6 15

set of information. Also explain its advantages : 3 10 20

1 7 5 8 2 6 9 3. 6 4 14 28

(b) Comment on the minimum complexity of sorting 5 2 8

algorithm is 0(n log n) in best case and 0(n2 ) in 6 8 18
worst case. 7 7 2 6 9
OR OR
MVM—47101 2 (Contd.) MVM—47101 3 (Contd.)

www.rtmnuonline.com
www.rtmnuonline.com

6. (a) Write algorithm to find out minimum cost spanning (b) Implement Bellman Ford algorithm for the
tree for the following graph, using PRIM’s following graph. Find the distance matrix : 7
algorithm : 7 1
1 2 8
10 28 –4
6 2 –3 4
14 5
7 16 4
25 24 6

5 3 –2
18
22 OR
4 12
8. (a) What is Travelling Salesman Problem ? Implement
(b) Draw the merge and split tree using Merge sorting Travelling Salesman Problem for the following
for array size of 15. Write recurrence equation matrix representing complete graph :
for merge sort algorithm. 6

7. (a) Draw optaimal binary search tree for the following  0 8 16 15 

 14 0 9 12 
parameter :  
 7 10 0 6  7
I pi qi  11 13 10 0 
 
0 — 0.05
(b) Write algorithm for LCS. Find the LCS of
1 0.15 0.10
following sequence :
2 0.10 0.05
X = a, a, b, a, a, b, a, b, a, a
3 0.05 0.05
Y = b, a, b, a, a, b, a, b. 7
4 0.10 0.15
5 0.20 0.10 7
MVM—47101 4 (Contd.) MVM—47101 5 (Contd.)

www.rtmnuonline.com
www.rtmnuonline.com

9. (a) Explain the significance of graph colouring (b) Write a non-deterministic algorithm to generate
algorithm. For the graph drawn complete solution CLIQUE of size K from graph of n vertices.
space tree if maximum number of colours permitted 5
are 3. Also write the algorithm for graph OR
colouring. 6
12. (a) Explain :
1 2
(i) P-NP class problem

4 3 (ii) NP hard and NP complete. 8

(b) Write algorithm for non-deterministic sorting.

(b) Explain 8-queen problem. Explain the explicit
5
and implicit constraints associated with this
problem. Give at least two solutions for this
problem. Write algorithm. 7
OR
10. (a) Design a solution for Hamiltonian path. Explain
how the solution can be used to solve Hamiltonian
cycle problem. 6
(b) Explain Articulation point in DFS and give the
complete algorithm for finding articulation point
of an undirected graph. 7
11. (a) Write short notes on :—
(i) Deterministic and non-deterministic
algorithm.
(ii) Polynomial Reduction. 8
MVM—47101 6 (Contd.) MVM—47101 7 3250

www.rtmnuonline.com