REGULATION: R-20

VISVODAYA ENGINEERING COLLEGE

(Affiliated to J.N.T.U.A, Approved by AICTE and Accredited by NAAC)
KAVALI – 524201, S.P.S.R Nellore Dist., A.P. India. Ph: 08626-240056

2022 – 23 II B. TECH I SEM

ADVANCED DATA STRUCTURES & ALGORITHMS (20A05301T)
MID – 1 QUESTION BANK
UNIT – I
ESSAY QUESTIONS:
1. a) What is asymptotic notation and what is its importance in representing time
complexity? Why is absolute run time not useful in representing time complexity?

(b) Write a recursive function/algorithm for finding largest number in an array

containing ‘n’ values.
2. (a) What is recursion and what are the properties of a recursive solution in
general?
(b) Write a recursive function/algorithm for linear search.
4. (a) Analyze the Time complexity for any Algorithm with an example.
(b) Distinguish between Average case, Best case and Worst case Complexities.
5. Classify the different Asymptotic notations with suitable examples.
6. Develop an Algorithm in Pseudo code specification and explain with steps.

UNIT – II
1. Write the algorithm to:
(a) Search an element in binary search tree.
(b) Delete an element from binary search tree.
2. (a) What are the advantages of binary search tree over binary tree?
(b) Give the algorithm and explain insertion into B tree.
 REGULATION: R-20

3. (a) What is an AVL tree and what are its advantages over binary search tree?

(b) Explain the case where the root is split and a new root node is added to a
B-Tree with an example.
4. (a) Explain about Binary search tree and their searching operation with an
example.
(b) Build a Binary Search Tree for the following elements.
{45, 15, 79, 90, 10, 55, 12, 20, 50}.
5. Construct an AVL Tree with the following keys:
{45,60,78,90,34,23,79,88,102,120,40}, after constructing delete the following
element 34,88,60 from the AVL tree.
6. Construct a B-tree of order of order 3 by inserting numbers from 1 to 10 and
also explain about Insertion operation in B-tree.

SHORT ANSWER QUESTIONS (2 MARKS):

UNIT – I
(a) Define Average case & worst case complexities
(b) What is meant by Time Complexity?
(c) Define Theta notation.
(d) Define Recursive function.
(e) What are the characteristics of an Algorithm.
(f) Define Space complexity.
(g) Define Worst case complexity & Write time complexity for linear search.
(h) What is the definiteness property of algorithms?
(i) What is the best case time complexity of searching for an element sequentially
in an array of ‘n’ number of elements?
(j) What is the effectiveness property of algorithms?
(k) How many comparisons will be done in the worst case on a sorted array of 10
numbers while performing binary search? Why?

UNIT – II
 REGULATION: R-20

a) Define AVL Tree.

b) What is B-Tree of order m?
c) Write the applications of Binary search trees.
d) Define Binary search tree.
e) List out various rotations performed in AVL tree.
f) What are the properties of B-Tree?
g) Construct an AVL Tree for following values: {15, 20, 24, 10, 13}
h) Define B-tree and list out the operations of it.
i) Write the Applications of AVL Trees.
j) Explain LR Rotations.
k) Write steps for searching operation in AVL Tree.
l) List out the cases for AVL Tree in deletion operation.
m) Write the applications of B-Trees.
n) What is a binary tree?
o) What is complexity of inserting an element in a B Tree? Substantiate your
answer.