Scribd
Upload
26 views2 pages

Adsaa DS Mid-2

Uploaded by

Srinivasan Nagaraj N
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
26 views2 pages

Adsaa DS Mid-2

Uploaded by

Srinivasan Nagaraj N
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

CHAITANYA BHARATHI INSTITUTE OF

TECHNOLOGY
(AUTONOMOUS)
Vidya Nagar, Proddatur, YSR Dist, A.P – 516360
II B.Tech I Semester (R23) MID–II Examinations, August– 2024
(23E05301T) ADVANCED DATA STRUCTURES& ALGORITHM ANALYSIS
( CSE-DS )
Date: 13/11/2024(FN) Time: 120 Minutes Max.Marks:25
PART-A
Answer the following (5 X 2 =10M)
(Compulsory Question)
Q.N Course Bloom’
Question Marks
o Outcome s Level
How does the partitioning process work in Quick
a) CO3 K1 2
sort?
What is the fractional knapsack problem and how
b) CO3 K2 2
does the greedy approach solve it?
1 What does the travelling sales person problem aim to
c) CO4 K2 2
achieve?
How does backtracking solve the 8-Queens
d) CO4 K1 2
Problem?
What is the role of bounding in solving the TSP
e) CO5 K2 2
using branch and bound?

PART-B
(Answer all the questions: 3 X 10 =30M).
Q.N Course Bloom’s
Question Marks
o Outcome Level
What are the main steps involved in the divide and
2 conquer approach? Describe the partitioning process CO3 K5 10
in Quick sort? How does it help in sorting the array?
(OR)
Describe the job sequencing problem with deadlines
and how the greedy method can be applied to solve it.
3 CO3 K5 10
Provide an example and discuss the conditions under
which the greedy solution is optimal.

Describe the Floyd-Warshall algorithm for finding all


4 pairs shortest paths in a weighted graph. Discuss its CO4 K4 10
time complexity and provide a step-by-step example.
(OR)
Explain the general method of backtracking? Describe
the 8-Queens problem and how backtracking is used
5 CO4 K5 10
to find all possible solutions. What are the key steps
involved in this approach?

6 Explain how the branch and bound method is used to CO5 K5 10


solve the Travelling Salesperson Problem (TSP) with
Example?
(OR)
Discuss the basic concepts of NP-Hard and NP-
Complete problems. Explain the significance of these
7 CO5 K4 10
classes in computational complexity theory and
provide examples of each.

Prepared by. Course coordinator HOD

Mrs A.Aparna,Asst.prof., CSE


Ms. S. Shajarin, Asst.Prof., CSE

You might also like