Printed Page: 1 of 2 

Subject Code: KCS503

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
B. TECH.
(SEM-V) THEORY EXAMINATION 2020-21
DESIGN AND ANALYSIS OF ALGORITHM
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

Qno. Question Marks CO
a. What is recurrence relation? How is a recurrence solved using master’s 2
theorem?
b. What is asymptotic notation? Explain Omega (Ω) notation? 2
c. Write down the properties of binomial tree. 2
d. Differentiate Backtracking algorithm with branch and bound algorithm. 2
e. Solve the recurrence T (n) = 4T(n/2) + n2 2
f. Explain Fast Fourier Transform in brief. 2
g. Write an algorithm for naive string matcher? 2
h. Explain searching technique using divide and conquer approach. 2
i. Explain Skip list in brief. 2

P
0Q
j. Explain how algorithms performance is analyzed? 2

1
SECTION B

13
29

2.
2. Attempt any three of the following:
0E

24
Qno. Question Marks CO
P2

5.
a. Write an algorithm for counting sort? Illustrate the operation of counting 10
_Q

.5
sort on the following array: A={4, 0, 2, 0, 1, 3, 5, 4, 1, 3, 2, 3} 17
b. Show the results of inserting the keys F, S, Q, K, C, L, H, T, V, W, M, 10
TU

R, N, P, A, B, X, Y, D, Z, E in order into an empty B-tree. Use t=3,

|1

where t is the minimum degree of B- tree.

AK

c. Discuss greedy approach to an activity selection problem of scheduling 10

4 7

several competing activities. Solve following activity selection problem

8:

S = {A1, A2, A3, A4, A5, A6, A7, A8, A9, A10}
:3

Si = {1, 2, 3, 4, 7, 8, 9, 9, 11, 12} Fi = {3, 5, 4, 7, 10, 9, 11, 13, 12, 14}

09

d. What is sum of subset problem? Draw a state space tree for Sum of 10
subset problem using backtracking? Let n=6, m=30 and w [1:6] = {5, 10,
1

12, 13, 15, 18}

02

e. Write KMP algorithm for string matching? Perform the KMP algorithm 10
2

to search the occurrences of the pattern abaab in the text string

b-

abbabaabaabab.
Fe

SECTION C
7-

3. Attempt any one part of the following:

|2

Qno. Question Marks CO

a. Solve the following recurrence relation: 10
i. T (n) = T (n-1) + n4
ii. T (n) = T (n/4) + T (n/2) + n2
b. Write an algorithm for insertion sort. Find the time complexity of 10
Insertion sort in all cases.

1 | P a g e  
 
AKTU_QP20E290QP | 27-Feb-2021 09:38:47 | 117.55.242.131
 Printed Page: 2 of 2 
Subject Code: KCS503
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
4. Attempt any one part of the following:
Qno. Question Marks CO
a. Write an algorithm for insertion of key in the Red-Black Tree. Discuss 10
the various cases for insertion of key in red-black tree for given sequence
of key in an empty red-black tree- 5, 16, 22, 25, 2, 10, 18, 30, 50, 12, 1.
b. Explain and write an algorithm for union of two binomial heaps and also 10
write its time complexity?

5. Attempt any one part of the following:

Qno. Question Marks CO
a. Define minimum spanning tree (MST). Write Prim’s algorithm to 10
generate a MST for any given weighted graph. Generate MST for the
following graph using Prim’s algorithm.

P
0Q

1
13
29

2.
0E

b. Explain Dijkstra’s algorithm to solve single source shortest path problem 10

24
with suitable example.
P2

5.
_Q

.5
6. Attempt any one part of the following: 17
TU

Qno. Question Marks CO

|1

a. What is travelling salesman problem (TSP)? Find the solution of 10

AK

following TSP using dynamic programming.

4 7

0 1 15 6
8:

2 0 7 3
:3

9 6 0 12
09

10 4 8 0
1
02

b. Discuss n queen’s problem. Solve 4 queen’s problem using backtracking 10

method?
2
b-
Fe

7. Attempt any one part of the following:

7-

Qno. Question Marks CO

|2

a. Write short notes on following: 10

(i.) Randomized algorithm.
(ii.) NP- complete and NP hard.
b. What is approximation algorithm? Explain set cover problem using 10
approximation algorithm.
 

2 | P a g e  
 
AKTU_QP20E290QP | 27-Feb-2021 09:38:47 | 117.55.242.131