Scribd
Upload
122 views

Btech Cse 5 Sem Design and Analysis of Algorithm 2012

This document contains a practice exam for the course "Design and Analysis of Algorithms". It has three sections: multiple choice questions worth 1 mark each (Group A), short answer questions worth 5 marks each (Group B), and long answer questions worth 15 marks each (Group C). The exam covers topics like algorithm analysis, greedy algorithms, dynamic programming, graph algorithms, NP-completeness, and more. Students must answer questions from each section in their own words as far as possible within the allotted time of 3 hours.

Uploaded by

Aratrik Basak
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
122 views

Btech Cse 5 Sem Design and Analysis of Algorithm 2012

This document contains a practice exam for the course "Design and Analysis of Algorithms". It has three sections: multiple choice questions worth 1 mark each (Group A), short answer questions worth 5 marks each (Group B), and long answer questions worth 15 marks each (Group C). The exam covers topics like algorithm analysis, greedy algorithms, dynamic programming, graph algorithms, NP-completeness, and more. Students must answer questions from each section in their own words as far as possible within the allotted time of 3 hours.

Uploaded by

Aratrik Basak
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

www.makaut.

com
http://www.makaut.com

Name : ……………………………………………………………
Roll No. : ……………………………………………..…………..
Invigilator’s Signature : ………………………………………..
CS/B.TECH(CSE)(N)/SEM-5/CS-501/2012-13
2012
DESIGN AND ANALYSIS OF ALGORITHM
Time Allotted : 3 Hours Full Marks : 70

The figures in the margin indicate full marks.


Candidates are required to give their answers in their own words
as far as practicable

GROUP – A
( Multiple Choice Type Questions )
1. Choose the correct alternatives for the following : 10 × 1 = 10
i) The Big O Notation of the expression
n
f (n) = n log 2 n + n 2 + e og2 is

a) O (n log n) b) O (n 2 )
2
log n
2
c) O(n) d) O (e ).
ii) Traveling Sa esman Problem is
a) NP Hard b) NP
c) NP Complete d) none of these.
iii) o ( g ( n ) ) is [ Read as small oh of g ( n ) ] is
a) asymptotically loose b) asymptotically tight
c) same as Big Oh d) None of these.
"n %
iv) Complexity the recurrence relation T(n) = 8T $ ' + n 2 is
#2&

a) O (n) b) O (n 2 )
c) O ( log 2 n) d) O (n 3 ).

5002(N) [ Turn over

http://www.makaut.com
www.makaut.com
http://www.makaut.com

CS/B.TECH(CSE)(N)/SEM-5/CS-501/2012-13

v) Kruskal's Algorithm is an example of


a) Dynamic Programming
b) Greedy Method
c) Both (a) and (b)
d) None of these.
vi) Complexity of Tower of Hanoi problem is
a) O (n) b) O (n 2 )
c) O ( 2n ) d) None of these.
vii) Binary Search algorithm can't be applied to
a) Sorted linked lists b) Sorted binary trees
c) Sorted linear array d) Sorted integer array.
viii) The technique of Pruning is used in
a) Branch and Bound
b) Backtracking
c) Divide and Conquer
d) Dynamic Programming.
ix) The tight bound for building a max heap is
a) O (n) b) O(log 2 n)
c) O (n. log 2 n) d) None of these.
x) The worst case running time of a quick sort algorithm is
a) O(n 2 ) b) O(n. log 2 n)
c O(n) d) O(log 2 n) .

GROUP – B
( Short Answer Type Questions )
Answer any three of the following. 3 × 5 = 15

2. Find the best and worst case time complexity of quick sort.

3. State Master's theorem and find out the time complexity for
the recurrence T (n) = T ( 2n/3) + 1.

5002(N) 2

http://www.makaut.com
www.makaut.com
http://www.makaut.com

CS/B.TECH(CSE)(N)/SEM-5/CS-501/2012-13

4. Find the optimal solution using greedy criteria for a


knapsack having capacity 100 kg for the following list of
items having values and weights as shown in the table.
Item Value Weight
I1 10 15
I2 20 25
I3 30 35
I4 40 45
I5 50 55
5. Compare and contrast BFS vs DFS.
6. Use the recursion tree to give an asymptotically tight solution
to the recursion T (n) = T ( n – a ) + T ( a ) + cn where
a > = 1 and c > 0 are constant.
GROUP – C
( Long Answer Type Questions )
Answer any three of the following. 3 × 15 = 45
"n %
7. Suppose we have a recurrence relation T(n) = aT $ ' + f (n) ,
#b&
show that the following are true.
"n %
a) If a f $ ' = k f (n) for some constant k < 1., then
#b&
T ( n ) = 0 ( f (n ) ). 5
"n
b) If a f $ ' = k f (n) for some constant k > 1, then
#b&
a
T(n) = O(n log ) . 5
b
"n %
c) If a f $ ' = k f (n) for some constant k = 1, the
#b&
a
T(n) = O (n log ) . 5
b
8. a) Discuss the Bellman-Ford's algorithm for single-source
shortest path problem. 7
b) Prove that the time-complexity of the algorithm is
" (VE) . 3
c) What is union-find algorithm ? Explain with an
example. 5

5002(N) 3 [ Turn over

http://www.makaut.com
www.makaut.com
http://www.makaut.com

CS/B.TECH(CSE)(N)/SEM-5/CS-501/2012-13

9. a) What are the characteristics of greedy algorithm ? 3


b) Discuss the activity selection problem for job
sequencing with an example. Prove that the time
complexity of the algorithm is O (n log n ). 5+3
c) Differentiate between greedy method and dynamic
programming. 4
10. a) Explain the max-flow min-cut theorem with an example.
6
b) Compare and contrast BFS ans DFS. State the 0/1
knapsack problem. 3+2
c) Describe the Clique Decision Problem CDP). Prove that
the CDP is NP complete. 2+2
11. Write short notes on any three of the f llowing : 3×5
a) Asymptotic Notations
b) Strassen's Matrix Mul iplication
c) Approximation A gorithms
d) Knuth-Morris-Pratt Algorithm
e) Recursion Tr es.

5002(N) 4

http://www.makaut.com

You might also like