Printed Page: 1 of 2
Subject Code: RCS502
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 ALGORITHMS
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
a. Define Asymptotic Notations.
b. Discuss properties of Binomial Tree.
c. Explain relaxation procedure of Dijkstra’s algorithm.
d. What do you mean principle of optimality?
e. Differentiate between P and NP complexity class.
f. Discuss the importance of stability in sorting.
g. Define fractional knapsack problem.
SECTION B
2. Attempt any three of the following: 3 7 x 3 = 21
03
7
a. Solve the following recurrence using recursion tree:
2.
0E
𝑇 𝑛 𝑇 𝛼𝑛 𝑇 1 𝛼 𝑛 𝑐𝑛, where 0 𝛼 1
24
b. Define properties of RB Tree. Prove that a red black tree with n internal nodes
P2
has height at most 2log(n+1)
5.
_Q
c. Consider Vertex ‘7’ as source, find the minimum spanning tree (MST) for the
.5
given graph using Prim’s Algorithm-
17
TU
|1
AK
3
:2
:11
09
d. Solve the following instance of 0-1 knapsack problem,
21
20
b-
Capacity of the knapsack is m=5
Fe
e. Explain KMP algorithm for string Matching in detail.
7-
|2
SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Show all steps used in sorting following elements in decreasing order using
Merge sort:
34, 67, 12, 45, 76, 24, 98, 42, 11
(b) Check whether Master method can be used to solve recurrence
𝑇 𝑛 2𝑇 𝑛𝑙𝑔𝑛 or not. Also find the solution of the recurrence
AKTU_QP20E033 | 27-Feb-2021 [Link] | [Link]
Printed Page: 2 of 2
Subject Code: RCS502
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
4. Attempt any one part of the following: 7x1=7
(a) Explain the Union procedure of binomial heap with the help of an example.
(b) Insert the following elements in an initially empty B Tree of minimum degree
t= 2:
23, 5, 72, 17, 54, 65, 32, 1, 8, 45, 89
5. Attempt any one part of the following: 7x1=7
(a) Find the Shortest path distance from source vertex ‘s’ to all vertices in the
following graph. Also draw the shortest path tree.
(b) Apply Strassen Matrix multiplication to multiply following matrices:
1 2 5 6
𝑎𝑛𝑑 3
3 4 7 8
03
7
2.
0E
6. Attempt any one part of the following: 7x1=7
24
(a) Given a set of positive integers S= {7, 3, 2, 5, 8} and an integer W = 14, find
P2
5.
all possible non-empty subsets, where sum of all elements is W.
_Q
.5
(b) Solve All pair shortest path problem in following graph:
17
TU
|1
AK
3
:2
:11
09
7. Attempt any one part of the following: 7x1=7
21
(a) What are approximation algorithms? Explain approximation algorithm for
20
travelling salesman problem.
b-
(b) Write short note on:
Fe
(i) Recursive FFT
(ii) Randomization algorithm
7-
|2
AKTU_QP20E033 | 27-Feb-2021 [Link] | [Link]
