Scribd
Upload
33 views2 pages

DAA (5th) Dec2016

This document contains a sample exam paper for the Design and Analysis of Algorithms course. It has three sections - Section A with 10 short answer questions worth 2 marks each, Section B with 4 long answer questions worth 5 marks each, and Section C with 2 long answer questions worth 10 marks each. The paper covers topics like algorithm analysis, sorting algorithms, string matching, dynamic programming, and complexity classes P and NP. Students have to attempt all questions in Section A and a total of 6 questions from Sections B and C within the allotted time of 3 hours.

Uploaded by

Raavi Saamar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views2 pages

DAA (5th) Dec2016

This document contains a sample exam paper for the Design and Analysis of Algorithms course. It has three sections - Section A with 10 short answer questions worth 2 marks each, Section B with 4 long answer questions worth 5 marks each, and Section C with 2 long answer questions worth 10 marks each. The paper covers topics like algorithm analysis, sorting algorithms, string matching, dynamic programming, and complexity classes P and NP. Students have to attempt all questions in Section A and a total of 6 questions from Sections B and C within the allotted time of 3 hours.

Uploaded by

Raavi Saamar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

16211 16211 16211 16211 16211 16211 16211 16211 16211

16211 Roll No.


16211 16211 16211 16211 16211 Total16211
No. of Pages
16211 : 02 16211

Total No. of Questions : 09


B.Tech.(CSE) (2011 Onwards) (Sem.–5)
16211 16211 DESIGN 16211
16211 AND ANALYSIS
16211 OF16211
ALGORITHMS
16211 16211 16211

Subject Code : BTCS-503


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

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

2. SECTION-B contains FIVE questions carrying FIVE marks each and students
have to attempt any FOUR questions.
3. SECTION-C contains T HREE questions carrying T EN marks each and students
16211 16211
have to16211
attempt any 16211 16211
T WO questions. 16211 16211 16211 16211

16211 16211 16211 16211


SECTION-A
16211

o m 16211 16211 16211 16211

.r c
1. Write briefly :

a. What is the time complexity of linear


16211 search?

m
16211 16211 16211 16211 16211 16211 16211 16211

b. Define algorithm.

p e o
a .r c
16211 16211 16211 16211 16211 16211 16211 16211 16211
c. What is Fast Fourier Transform (FFT)?

r p
d. Explain divide and conquer technique.
e
16211 16211 16211

b 16211 16211 16211

p
16211 16211

e. Give the recurrence relation for the time complexity of merge sort algorithm.

a
16211

rp
f. Differentiate between exponential versus polynomial running time.
16211 16211 16211 16211 16211 16211 16211 16211 16211

16211 16211 h. How is the accuracy


16211 of approximation
16211 16211 b
g. State the principle of optimality used in dynamic programming.

algorithm measured?
16211 16211 16211 16211

i. Algorithm A performs 10n2 basic operations, and algorithm B performs 300 logn
16211 16211
basic operations. 16211
16211
For what value
16211
of n does 16211
algorithm B 16211
start to show 16211
its better 16211
performance?

j. What do you mean by NP-complete?


16211 16211 16211 16211 16211 16211 16211 16211 16211

16211 1 | M-70536
16211 16211 16211 16211 16211 16211 (S2)-639
16211 16211

16211 16211 16211 16211 16211 16211 16211 16211 16211


16211 16211 16211 16211 16211 16211 16211 16211 16211

SECTION-B
16211 16211 16211 16211 16211 16211 16211 16211 16211

2. Explain the classes P and NP.

16211 3.
16211 Explain16211
Strassen’s algorithm
16211 for matrix
16211 multiplication
16211 with an example.
16211 16211 16211

4. Give a suitable example and explain Breadth-First search and Depth-First search
algorithms.
16211 16211 16211 16211 16211 16211 16211 16211 16211

5. What are asymptotic notations? Describe with the help of examples commonly used
asymptotic notations.
16211 16211 16211 16211 16211 16211 16211 16211 16211
6. How the dynamic algorithms differ from greedy algorithm? Explain.

16211 16211 16211 16211 16211 16211 16211 16211 16211

SECTION-C

16211 7.
16211 Explain16211
the algorithm16211
of merge sort.
16211

o m
Compute the16211
time complexity
sort the list 415, 213, 700, 515, 712, 715 using merge sort.
16211 of merge 16211
sort. Also 16211

16211
8.
16211 16211 16211 16211
.r c
Explain string matching. Explain Knuth-Morris-Pratt algorithm with an example.
16211 16211

m
16211 16211

9.
e
Write a short note on the following :

p o
a .r c
16211 16211 a. Greedy
16211 algorithm16211 16211 16211 16211 16211 16211

b. Randomization.

r p e
16211 16211 16211

b 16211 16211

a
16211

p
16211 16211 16211

rp
16211 16211 16211 16211 16211 16211 16211 16211 16211

16211 16211 16211 16211 16211 b 16211 16211 16211 16211

16211 16211 16211 16211 16211 16211 16211 16211 16211

16211 16211 16211 16211 16211 16211 16211 16211 16211

16211 2 | M-70536
16211 16211 16211 16211 16211 16211 (S2)-639
16211 16211

16211 16211 16211 16211 16211 16211 16211 16211 16211

You might also like