14555 14555 14555 14555 14555 14555 14555 14555 14555

14555 Roll No.

14555 14555 14555 14555 14555 Total14555
No. of Pages
14555 : 02 14555

Total No. of Questions : 09

B.Tech.(CSE) (2011 Onwards) (Sem.–5)
14555 14555 DESIGN 14555
14555 AND ANALYSIS
14555 OF14555
ALGORITHMS
14555 14555 14555

Subject Code : BTCS-503

Paper ID : [A2099]
14555 Time : 3 Hrs.
14555 14555 14555 14555 14555 Max. Marks
14555 14555 : 60 14555

INSTRUCTION TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks

m
14555 14555
each. 14555 14555 14555 14555 14555 14555 14555

2. SECTION-B contains FIVE questions carrying FIVE marks each and students
has to attempt any FOUR questions.

o
.r c
3. SECTION-C contains T HREE questions carrying T EN marks each and students
14555 14555 14555
has to attempt any T14555 14555
WO questions. 14555 14555 14555 14555

14555 14555 14555

pe
14555
SECTION-A
14555 14555

o m
14555 14555 14555

a .r c
1. Write briefly :

14555 14555 a. Define

r p
14555 time complexity
14555 and space complexity of
14555 an algorithm.14555
14555

e
14555 14555

14555 14555
b
14555 14555 14555

a p
b. List various applications of BFS and DFS algorithms.
14555 14555 14555 14555

rp
c. What is the advantage of using merge-sort algorithm over quick-sort algorithm?

b
d. What would be the running time of radix sort on an array of n integers in the range
5
14555 14555 0..n14555
– 1 when base –10 representation
14555 14555 is used?14555 14555 14555 14555

e. What do you mean by NP-complete problems?

14555 14555 14555 14555 14555 14555 14555 14555 14555
f. What are the average and worst case time complexities of mergesort and quicksort
algorithms?
14555 14555 14555 14555 14555 14555 14555 14555 14555
g. What do you mean by convex hull?

h. What are the applications of Fast Fourier Transform (FFT)?

14555 14555 14555 14555 14555 14555 14555 14555 14555

i. Differentiate between graph and a tree.

14555 14555
j. Define
14555
Algorithm14555
Validation. 14555 14555 14555 14555 14555

14555 1 | M-70536
14555 14555 14555 14555 14555 14555 (S2)-745
14555 14555

14555 14555 14555 14555 14555 14555 14555 14555 14555

14555 14555 14555 14555 14555 14555 14555 14555 14555

SECTION-B
14555 14555 14555 14555 14555 14555 14555 14555 14555

2. What are asymptotic notations? Describe with the help of examples various commonly
used asymptotic notations.
14555 14555 14555 14555 14555 14555 14555 14555 14555

3. Write an algorithm based on divide-and-conquer strategy to search an element in a given

list. Assume that the elements of list are in sorted order.
14555 14555 14555 14555 14555 14555 14555 14555 14555
4. Describe an algorithm that can perform selection in worst case linear time.

5. Describe Bellman-Ford algorithm to solve single-source shortest path problem. What is

m
14555 14555 its time14555
complexity? 14555 14555 14555 14555 14555 14555

6.
o
Describe how polynomial-time reductions are used to prove that a problem is NP-

.r c
14555 14555
complete.
14555 14555 14555 14555 14555 14555 14555

14555 14555 14555

pe
14555 14555
SECTION-C 14555

o m
14555 14555 14555

7.
a .r c
Define spanning tree. Write Kruskal’s algorithm for finding minimum spanning tree.

p
r
Using Kruskal’s algorithm, find minimum spanning tree for the graph
14555 given below
14555:

e
14555 14555 14555 14555 14555 14555 14555

14555 14555
b
14555 14555 14555

a p
14555 14555 14555 14555

14555 14555 14555 14555

b
14555 rp 14555 14555 14555 14555

14555 8.
14555 Describe how an array
14555 of elements 14555
14555 can be sorted using
14555 Quick Sort
14555algorithm. Show
14555 that 14555
2
the running time of Quick Sort is 0(n ) when the array A contains distinct elements and is
sorted in decreasing order.
14555 14555 14555 14555 14555 14555 14555 14555 14555
9. Describe in detail Knuth-Morris-Pratt string matching algorithm.

14555 14555 14555 14555 14555 14555 14555 14555 14555

14555 14555 14555 14555 14555 14555 14555 14555 14555

14555 2 | M-70536
14555 14555 14555 14555 14555 14555 (S2)-745
14555 14555

14555 14555 14555 14555 14555 14555 14555 14555 14555