Roll No. Total No.

of Pages: 02
Total No. of Questions: 09
B. Tech. (Sem.-5th)
DESIGN & ANALYSIS OF ALGORITHMS
Subject Code: CS-307
Paper ID: [A0467]
Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATE:
1. Section –A, is Compulsory.

m
2. Attempt any four questions from Section-B.

o
3. Attempt any two questions from Section-C.

.r cSection –A (10x2=20)
Q.1.

(a)
Write Briefly

p e
Define algorithm validation

(b)

p a
What is the time complexity of binary search?.

(c)
r
Explain Knapsack problem.

b o m
(d)

(e)
w .
Define min-heap.

What are the applications of dynamic programming? .r c

w (f) Advantages of Brute force approach?
p e
w (g) What is the difference between a Live Node and a Dead Node?
a
(h) Define Feasible and optimal solution?
r p
(i) What is topological sorting? Where it is required?
.b
(j)
w
Specify the problems already proved to be NP-complete..

w
Q.2.
w
Section –B

Solve 8 queens problem using back tracking.

(4x5=20)

Q.3. Write a pseudo code for divide & conquer algorithm for merging two sorted arrays in to a
single sorted one. Explain with example.

Page: 1
M-56526
 Q.4. Define asymptotic notations. Distinguish between asymptotic and conditional asymptotic
notation

Q.5. Define recurrence equation and explain how solving recurrence equations are done.

Q.6. Explain branch and bound technique . Apply it to the following instance of Assignment
problem.

Job1 Job2 Job3 Job4

Person A 9

o m 2 7 8

.r c
Person B 6 4 3 7

Person C

p e 5 8 1 8

a
Person D 7 6 9 4

r p m
. b Section –C
o
(2x10=20)

w .r c
w
Q.7 (a)Explain radix sort Algorithm.

p e
w
(b)What are randomized algorithms? What are its advantages?

Q.8.

p a
From a given adjacency list representation of a directed graph how do you find the in

r
degree and out degree of the vertices? Analyse the algorithm.

b
Q.9. In a graph, explain breadth first search.

w .
w w
-----END-----

Page: 2
M-56526