Scribd
Upload
20 views2 pages

R-2015 - 15CT1107 - Design and Analysis of Algorithms

The document outlines an exam for a design and analysis of algorithms course. It contains 10 questions across 5 units on topics like analyzing algorithm efficiency, divide and conquer, sorting algorithms, optimal binary search trees, the traveling salesman problem, and NP-complete problems.

Uploaded by

ajayjutke4
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
20 views2 pages

R-2015 - 15CT1107 - Design and Analysis of Algorithms

The document outlines an exam for a design and analysis of algorithms course. It contains 10 questions across 5 units on topics like analyzing algorithm efficiency, divide and conquer, sorting algorithms, optimal binary search trees, the traveling salesman problem, and NP-complete problems.

Uploaded by

ajayjutke4
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

Course Code :15CT1107/ 2015 R-2015 Reg.

No :

GAYATRI VIDYA PARISHAD COLLEGE OF ENGINEERING (AUTONOMOUS)


Madhurawada, Visakhapatnam
Affiliated to JNT University – K, Kakinada
B.Tech IV Semester Supplementary Examinations ,March-2022
Design and Analysis of Algorithms
(Common to CSE & IT)

Date:17-03-2022 Time: 3 Hours Max. Marks: 70


1. Answer ONE Question from each UNIT
2. All parts of a Question must be answered in one place to get valued.
3. All questions carry equal marks.

UNIT-I
1. a) Explain the necessary steps for analyzing the efficiency of recursive algorithms. 7 Marks
b If f (n)=a m nm +am −1 nm−1 +…+ a1 n+a0 then prove that f (n)=O (nm ) 7 Marks
)
2. a) Write the algorithm for matrix multiplication and find the time complexity of this 7 Marks
algorithm using the step count method.

b Write the algorithm for the Bi-connected components. 7 Marks


)
UNIT-II

3. a) Describe the general divide and conquer method. Find the location of 45 in the given array 8 Marks
by applying the binary search algorithm? A=(9,12,15,24,30,36,45,70)

b What is a stable sorting method? Is Quicksort a stable sorting method? Justify it. 6 Marks
)
4. a) Find the optimal solution to the job sequencing with deadlines for the following: 10 Marks
n = 7, (P1,P2,P3,P4,P5,P6,P7) = (3,5,20,18,1,6,30) , (d1,d2,d3,d4,d5,d6,d7) =
(1,3,4,3,2,1,2).
b Write the difference between Prim’s and Kruskal’s approaches to obtain a minimum 4 Marks
) spanning tree.
UNIT-III
5. a) Draw an optimal binary search tree for n=4 identifiers ( a1,a2,a3,a4)=(do,if,int, while) 10 Marks
P(1:4)=(3,3,1,1) and Q(0:4)=(2,3,1,1,1).
b Explain the following terms: (i) Principle of optimality, (ii) Reliability design. 4 Marks
)
6. a) Discuss the Travelling Sales Person problem for the given graph and obtain an optimum 10 Marks
cost tour.

Page 1 of 2
Course Code :15CT1107/ 2015 R-2015 Reg. No :

b 4 Marks
) Explain what is the purging rule in the 0/1-knapsack problem.

UNIT-IV
7. a) Let w={11,13,24,7} and m=31. Find all possible subsets of w that sum to m. Draw the 7 Marks
portion of the state space tree that is generated
b Draw and explain the state space tree for the 4-queens problem that is generated during 7 Marks
) backtracking.
8. a) Draw the portion of state space tree generated by LCBB for the following knapsack 7 Marks
instance:
n=4 , m=15, (p1,p2, p3,p4) = (10,10,12,18) and (w1,w2,w3,w4) = (2,4,6,9).
b Draw the state space representation of the Hamiltonian cycle in the following undirected 7 Marks
) graph.

UNIT-V
9. a) State and prove Cook’s theorem. 7 Marks
b Explain non deterministic algorithm with examples. 7 Marks
)
10. a) Compare the NP-complete and NP-hard problems. 7 Marks
b Briefly explain the Cliques decision problem. 7 Marks
)

Page 2 of 2

You might also like