Scribd
Upload
359 views

DAA RR Question Paper 2024

design and analysis of algorithms question paper

Uploaded by

varishadora
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
359 views

DAA RR Question Paper 2024

design and analysis of algorithms question paper

Uploaded by

varishadora
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/ 4

[Apr-24]

GITAM (Deemed to be University)


[CSEN3001]
GST/GSS/GSB/GSHS Degree Examination
DESIGN AND ANALYSIS OF ALGORITHMS

Time: 2 Hours Max. Marks: 30


-----------------------------------------------------------------------------------------------------
Instructions: All parts of the unit must be answered in one place only.
----------------------------------------------------------------------------------------------------
Section-A
1. Answer all questions: (51=5)
a) What is the minimum time required to sort the given ‘n’
elements?
b) What is spanning tree? Give an example.
c) Define the Reliability design problem.
d) Differentiate between DFS and BFS.
e) Define Live node, E-node and Dead node.
Section-B
Answer the following: (55=25)
UNIT-I
2. Apply the Master’s theorem to solve the following recurrence
equations.
i) T(n) = T(n/2) + n3
ii) T(n) = 8T(n/2) + n2
OR
3. Illustrate the binary search using divide and conquer technique to
find a key element in a list taken as an example and also estimate the
time complexity.
UNIT-II
4. Solve the following graph using the Prim’s algorithm to find the
minimum cost spanning tree.
OR
5. Make use of the Dijkstra’s algorithm to find the shortest path from
the source vertex 1, to other vertices and derive the time complexity
of this algorithm. [source: vertex 1]

UNIT-III
6. Calculate the optimal tour for the Travelling salesman using
Dynamic programming by taking vertex 1 as source from the given
graph.
OR
7. Apply all-pairs shortest path algorithm with dynamic programming
on the given graph. Mention its time complexity.

UNIT-IV
8. Estimate the Sum of subset problem using Backtracking technique
for the given set and also draw the state space tree for the following
data. Number of elements, n=5, Sum, w=21, Set,
S = {5,6,10,11,16}
OR
9. Summarize the 4 – queen’s problem. Draw the portion of the state
space tree for n = 4 queens using backtracking algorithm.
UNIT-V
10. Illustrate the Lagrange Interpolation with its algorithm.

OR
11. Explain Least cost Branch and Bound with an example.

[SL/124]

You might also like