Scribd
Upload
12 views

DAA(5th)Dec2020

The document is an examination paper for the B.Tech. (CSE) program focusing on Design & Analysis of Algorithms, consisting of three sections with a total of 18 questions. Section A includes 10 compulsory questions worth 2 marks each, Section B has 5 questions worth 5 marks each (students must attempt 4), and Section C contains 3 questions worth 10 marks each (students must attempt 2). The paper covers various topics including asymptotic notation, NP class problems, greedy algorithms, and specific algorithms like KMP and quick sort.

Uploaded by

66codewarrior99
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
12 views

DAA(5th)Dec2020

The document is an examination paper for the B.Tech. (CSE) program focusing on Design & Analysis of Algorithms, consisting of three sections with a total of 18 questions. Section A includes 10 compulsory questions worth 2 marks each, Section B has 5 questions worth 5 marks each (students must attempt 4), and Section C contains 3 questions worth 10 marks each (students must attempt 2). The paper covers various topics including asymptotic notation, NP class problems, greedy algorithms, and specific algorithms like KMP and quick sort.

Uploaded by

66codewarrior99
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

Roll No. Total No.

of Pages : 02
Total No. of Questions : 18
B.Tech. (CSE) (2012 to 2017) (Sem.–5)
DESIGN & ANALYSIS OF ALGORITHMS
Subject Code : BTCS-503
M.Code : 70536
Time : 3 Hrs. Max. Marks : 60

INST RUCT IONS T O CANDIDAT ES :


1. SECTION-A is COMPULSORY cons is ting of TEN questions carrying TWO marks
each.
2. SECTION-B c ontains FIVE questions c arrying FIVE marks eac h and s tudents
have to atte mpt any FOUR ques tions.
3. SECTION-C contains THREE questions carrying TEN marks e ach and s tudents
have to atte mpt any TWO questions.

SECTION-A

Answer the following briefly :


o m
1) What is asymptotic notation?
r . c
2) Define Big Oh.
p e m
p a c o
3)
.
What are the steps involved in proving a problem to be NP complete?

r r
4)
b
What are the applications of Fast Fourier transform?

p e
5)
a
How the Prim’s algorithm is better in finding the Minimal spanning tree in comparison to
the Kruskal’s method?
p
6)
b r
What is the time complexity of the algorithm for finding all-pairs-shortest-path problem?

7) What are NP class problems?

8) What is the minimal spanning tree? What are its advantages?

9) What is a deterministic algorithm?

10) Distinguish between deterministic and non-deterministic algorithms.

1 | M-70536 (S2)-1117
SECTION-B

11) What is the relationship between the classes P and NP? Explain. (5)

12) Explain the Big -Oh computation for each of the following control structures : (5)

a) Sequencing b) If-then-else c) “for” loop

c) “While” loop e) Recursion

13) What do you analyze in an algorithm? What is the basis of analysis? Explain. (5)

14) Explain topological sort with an example. (5)

15) What are greedy algorithms? What are their characteristics? Explain any greedy
algorithm with example. (5)

o m
SECTION-C

r. c
16) Explain the KMP algorithm in detail with an illustrative example. (10)

e m
17) Explain in detail quick sorting method. Provide a complete analysis of quick sort.
p
(10)

a o
18) Order the following functions by growth rate: N, N1.5, N2, N log log N, N log2 N, N log
p c
r .
(N2), 2/N, 2 N, 2 N/2 , 37, N2 log N, N3 Indicate which functions grow at the same rate. (10)
r
b p e
p a
b r

2 | M-70536 (S2)-1117

You might also like