ADS(Question Bank)
ADS(Question Bank)
Subject with Code: Data Structures & Algorithms (23CI05601) Regulation: R23
Course & Branch: B.Tech – CSE,CSM,CIA,CAD Year & Sem: II Year & I Sem
UNIT-I
INTRODUCTION, AVL TREES, B-TREES
1 a) What do you mean by algorithm? List some of the properties of it. [L1] [CO1] [2M]
b) Discuss the steps involved in performance analysis. [L2] [CO1] [2M]
c) Define Balance Factor. [L2] [CO1] [2M]
d) What is an AVL tree? Give one example. [L1] [CO1] [2M]
e) What is B-Tree? Give one example. [L1] [CO1] [2M]
2 a) Illustrate an algorithm for Finding sum of natural number. [L2] [CO1] [5M]
b) Analyze space complexity and time complexity in detail with example. [L4] [CO1] [5M]
3 What is Asymptotic Notation? Explain different types of notations with [L2] [CO1] [10M]
examples.
4 Discuss briefly with suitable example about Big ‘O’ notation and Theta [L2] [CO1] [10M]
notation ‘Ѳ’.
5 a) Discuss factors affecting the time complexity. [L2] [CO1] [5M]
b) Compare between Priori analysis and Posteriori analysis. [L4] [CO1] [5M]
6 Explain different AVL rotations with suitable examples. [L2] [CO1] [10M]
7 a) Write the applications and operations of an AVL tree. [L3] [CO1] [5M]
b) Define the Balance Factor of a node in an AVL tree. How is it calculated, [L2] [CO1] [5M]
and what is its significance?
8 Construct an AVL Tree by inserting numbers from 1 to 8. [L6] [CO1] [10M]
9 a) Write the applications and Operations of the B-Tree. [L3] [CO1] [5M]
b) Elaborate the B-Tree Deletion Operation with suitable example. [L3] [CO1] [5M]
10 Construct a B-Tree of order 3 by inserting numbers 1 to 10. [L3] [CO1] [10M]
Course Code: 23CI0601 R23
UNIT –II
HEAP TREES, GRAPHS, DIVIDE AND CONQUER
b) Build any one application of dynamic programming with an example. [L3][CO1] [5M]
3 Construct an optimal solution for Knapsack problem, where n=7,M=15 and [L3][CO3] [10M]
(p1,p2,p3,p4,p5,p6,p7) = (10,5,15,7,6,18,3) and (w1,w2,w3,w4,w5,w6,w7) =
(2,3,5,7,1,4,1) by using Greedy strategy.
4 Implement the Single Source Shortest Path using Dijkstra’s algorithm for the [L4][CO3] [10M]
given graph.
5 What is Minimum Cost Spanning Tree? Implement the Kruskal’s algorithm [L1][CO3] [10M]
and Prims algorithm.
6 Construct optimal binary search tree for the given problem n=4,(a1,a2,a3,a4)= [L6][CO3] [10M]
(a,b,c,d), P(1,2,3,4,)=(3,3,1,1),Q(0,1,2,3,4)=(2,3,1,1,1).
7 Solve Single Source Shortest Paths problem using dynamic programming. [L3][CO3] [10M]
Course Code: 23CI0601 R23
8 a) Explain 0/1 knapsack problem by using dynamic programming with an [L2][CO3] [5M]
examples.
b) Measure the String Editing problem with example. [L5][CO3] [5M]
9 Construct an algorithm for All pairs of shortest path and calculate shortest [L6][CO3] [10M]
path between all pairs of vertices by using dynamic programming method
for the following graph.
10 Analyze the minimum cost tour for given problem in travelling sales person [L4][CO3] [10M]
Concepts by using dynamic programming.
Course Code: 23CI0601 R23
UNIT –IV
BACKTRACKING, BRANCH AND BOUND
8 Simplify 0/1 knapsack problem and design an algorithm of LC Branch and [L4][CO4] [10M]
Bound and find the solution for the knapsack instance of n = 4,(p1, p2, p3,
p4) = (10, 10, 12, 18), (w1,w2, w 3, w4) = (2, 4, 6, 9) and M = 15.
9 a) Explain the procedure for Travelling Sales Person Problem using branch and [L2][CO4] [5M]
bound.
b) Explain the principles of FIFO branch and bound. [L2][CO4] [5M]