Sub Code: 23CS/IT/AD/AM3T04 MIC23

B. Tech III Semester Regular Examinations

ADVANCED DATA STRUCTURES & ALGORITHM ANALYSIS
(Common to CSE, IT, AI&DS, AI&ML)
(Model Paper-II)
Time: 3 hours Max Marks: 70M
------------------------------------------------------------------------------------------------------
Note: 1. Question paper consists of two parts (Part A and Part B)
2. Answer all sub questions from Part A
3. Answer all questions from Part B with either or choice

PART – A 10 X 2 = 20 M
Marks BTL CO
● What is the maximum and minimum number of keys that
1. a) 2M L1 CO1
can be stored in a node of a B-tree of order m.
b)● Write any two applications of B-tree 2M L1 CO1
c)● Name the different ways of representing a graph? 2M L1 CO2
● Give the best, worst, average cases and their respective
d) 2M L1 CO2
time complexities for Merge sort
● Explain the working of Divide and Conquer algorithm
e) 2M L2 CO3
paradigm
● Distinguish between dynamic programming and Greedy
f) 2M L4 CO3
method
● How does Branch and Bound differ from Backtracking?
g) 2M L1 CO4
Give two key differences.
● What are the different Branch and Bound methods used
h) 2M L1 CO4
in solving a problem?
● Give examples for a NP-Hard and a NP-Complete
i) 2M L1 CO5
problem.
j)● Write any two real world applications of string matching 2M L1 CO5
PART – B 5 X 10 = 50 M
UNIT – I
1. a) Explain the insertion operation on a B tree. 5M L2 CO1
Define B-Tree. Generate a B-Tree of order 3 for the
b) 5M L1 CO1
following key values: 25,10,12,15,39,64,53
(OR)
2. a) Explain insert and delete operations of Min heap. 5M L2 CO1
b) Construct a max-heap using the elements 10, 2, 7, 6, 5,
5M L3 CO1
9, 12, 35, 22, 15, 1, 3, 4
UNIT – II
3. a) Explain BFS of a graph with example. 5M L2 CO2
Taking an example of 4×4 matrix, write the Strassen 's
matrix multiplication equations. Show how Strassen 's
b) 5M L1 CO2
matrix Performs better than matrix multiplication using
divide and conquer.
(OR)
4. a) Illustrate briefly on Asymptotic Notations. 5M L2 CO2
Sort the following numbers using Merge sort 3,8, 27, 43,
b) 3, 9, 82, 10 7, 13, 25. And explain the step-by-step 5M L2 CO2
procedure.

Page 1 of 2
 UNIT – III6
Solve the following 0/1 knapsack problem using dynamic
5. a) 5M L6 CO3
programming: N=4, M=21, P= (12,20,6,17), W=(11,5,10,7)
Give the steps for the implementation of Kruskal
algorithm. Find the minimum spanning tree of the
following graph using Kruskal algorithm.

b) 5M L1 CO3

(OR)
6. a)● Explain Prim's algorithm with an example? 5M L2 CO3
Explain 0/1 Knapsack problem solution using Dynamic
b) 5M L2 CO3
programming.
UNIT – IV
● Describe the Travelling sales person problem and discuss
7. a) 5M L2 CO4
how to solve it using branch and bound
Explain the Graph – coloring problem. And draw the state
b) space tree for m= 4colors and n=4 vertices complete 5M L2 CO4
graph.
(OR)
Solve Knapsack Problem using Branch and Bound for the
8. a) given data. Capacity n=5, m=6 {P1, P2, P3, P4, P5} = 5M L6 CO4
{25,20,15,40,50} {W1, W2, W3, W4, W5} = {3,2,1,4,5}
● Explain how to solve sum of subsets problem using
b) 5M L2 CO4
backtracking.
UNIT – V
9. a)● Write and explain the Cooks theorem. 5M L2 CO5
b) Difference between NP-hard and NP-complete problems. 5M L4 CO5
(OR)
10. a) Briefly discuss about String Matching. 5M L6 CO5
b) Discuss about Scheduling identical processors. 5M L6 CO5

*** End of the Question Paper ***

Page 2 of 2