Scribd
Upload
354 views2 pages

DAA Question Paper Set - 1

Uploaded by

Sri S.Rakesh Assistant Professor(C)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
354 views2 pages

DAA Question Paper Set - 1

Uploaded by

Sri S.Rakesh Assistant Professor(C)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Code No: 16IT C08

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (Autonomous)


B.E. (IT) IV Sem (Backlog) Examination April – May 2020
DESIGN AND ANALYSIS OF ALGORITHMS
Time: 3 Hours Max Marks: 70
Note: Answer all questions from Part-A at one place in the same order
Answer any Five questions from Part -B
Part - A (20 Marks)
*M *CO *BT
1 Define Big-Oh Notation? Give one example. (2) 5 R
2 List the properties of Priority Queue. (2) 2 U
3 Outline the general method of Divide and Conquer approach. (2) 1 U
4 What is the best case and worst case time complexity of Quick sort? (2) 5 A
5 Compare BFS and DFS. (2) 2 A
6 Define Principle of Optimality. (2) 3 R
7 What is Hamiltonian cycle? Give one example. (2) 4 U
8 Discuss the principles of FIFO Branch and Bound approach. (2) 4 U
9 Define NP-Hard problem? Write examples of NP-Hard graph problems. (2) 6 R
10 What do you meant by non-deterministic algorithm? (2) 6 U
Part - B (50 Marks)
*M *CO *BT
11 (a) Describe Weighted Union and Collapsing Find algorithms. 5 1 A
(b) Define Max Heap? Construct the Max Heap for the array of elements 5 2 E
[3,5,6,7,20,8,2,9,12,15,30,17].
12 (a) Find an Optimal Solution to the knapsack instance n=7, m=15, 5 1 A
(P1,P2…..P7)=(10,5,15,7,6,18,3) and (W1,W2…..W7)=(2,3,5,7,1,4,1)
(b) Explain the working of Merge sort Algorithm with your own example. 5 3 A
13 (a) Use function OBST to compute w(i,j),r(i,j) and c(i,j) , 0<=i<j<=4 for 8 3 A
the identifier set (a1,a2,a3,a4)=(count,float,if,while) with p(1)=1/20,
p(2)=1/5,p(3)=1/10,p(4)=1/20,q(0)=1/5,q(1)=1/10,q(2)=1/5,q(3)=1/20
and q(4)=1/20.Using the r(i,j)’s, construct the optimal binary search
tree.
(b) Is Dynamic programming is best compared to Greedy method? Justify. 2 5 U
14 (a) Solve the given Travelling sales person problem using LCBB (Least 5 4 A
Cost Branch and Bound).
1 2 3 4 5
1 ∞ 20 30 10 11
2 15 ∞ 16 4 2
3 3 5 ∞ 2 4
4 19 6 18 ∞ 3
5 16 4 7 16 ∞

(b) Explain the general method of backtracking technique by solving 8- 5 4 U


Queens problem.
15 (a) Explain P,NP,NP-Hard and NP-Complete classes with suitable 5 6 U
examples.
(b) What is a Job Shop? Write the constraints for the job shop scheduling 5 6 U
problem and explain its performance evaluation criteria.
16 (a) Define Recursion? Write the algorithm for Towers of Hanoi problem. 5 1 C
(b) What is Spanning tree? Compare and Contrast Prim’s and Kruskal’s 5 2 A
algorithms.
17 (a) Define Articulation Point? Illustrate with example. 3 3 A
(b) Draw the state space tree for m-coloring when n=3 and m=3 4 4 U
(c) Define Clique and Node Cover of a graph? Give examples 3 6 U
*****

*M – Marks , *CO – Course Outcomes , *BT – Blooms Taxonomy


Summary (to be filled by the question paper setter):
Indicate the percentage for each of the following criteria from the questions framed.
1. Fundamental knowledge from Level 1 & 2 : 60 %
2. Knowledge on application and analysis from Level 3 & 4 : 30 %
3. Critical thinking and ability to design from Level 5 & 6 : 10 %

You might also like