H.T NO.

R 2 MLR20
Course Code: A5CS09

MLR INSTITUTE OF TECHNOLOGY

(An Autonomous Institute)
II B.Tech. II Semester Supplementary Examination February-2023
ADVNACED DATA STRUCTURE
(Common to CSE, CSIT & IT)
Time: 3 Hours. Max. Marks: 70
Note: 1. This question paper contains two parts A and B.
2. Part -A is Compulsory which carries 20 marks. Answer all Questions in part A.
3. Part -B consists 5units.Answer any one question from each unit. Each question
carries 10 marks and may have a, b, c as sub questions.

PART- A 10 x 2Marks=20M

1 CO BL
a) What is data structure 2M
. 1 1
CO BL
b) What is self-referential structure 2M
1 1
CO BL
c) Define node degree of a tree 2M
1 1
CO BL
d) Define height of a node and tree 2M
1 1
CO BL
e) List any two types of graphs 2M
1 1
List two differences between binary tree and binary CO BL
f) 2M
search tree 1 1
CO BL
g) Define an M-ordered tree 2M
1 1
h CO BL
Define red-black tree 2M
) 1 1
CO BL
i) Define pattern matching 2M
1 1
CO BL
j) Define how tries concept used for pattern matching 2M
1 1

PART- B 5 x 10Marks=50M
List different linear and non-Linear data structures CO BL
a) 5M
and write about stack ADT arrays implementation. 1 2
2
b CO BL
Implement operations of queue using arrays concept. 5M
) 1 2
OR
Define hash function and write any three hash CO BL
a) 5M
functions with example 1 2
3
b Write about collision and explain how it is resolved in CO BL
5M
) open hashing 1 2

4 Write terminology of tree and properties of binary tree CO BL

a) 5M
2 2
b Write about different tree traversal techniques and 5M CO BL
) apply on below tree 2 2
 OR
Page 1 of 2
Explain about priority queue and min heap concept. CO BL
a) 5M
2 2
5
b Explain different operations on priority queue using CO BL
5M
) max heap concept. 2 2

Explain graphs its representation using adjacency list CO BL

6 10M
and its traversal using an example. 3 2
OR
Explain about binary search tree and implement CO BL
7 different operations on it with example. 10M
3 2

Explain about B-Tree and implement insertion,

CO BL
8 deletion and search operations on m ordered B-tree 10M
4 2
with an example.
OR
Explain about Red-Black tree with an appropriate CO BL
a) 5M
examples 4 2
9
b Explain about splay tree with an appropriate CO BL
5M
) examples 4 2

1 Explain about text processing and write about brute CO BL

force algorithm for pattern matchingwith an example. 5M
0 5 2
OR
Explain about kunth Morris-Pratt algorithm and CO
1 BL
Tries-Standard algorithm for pattern matching with 5M
1 5 2
an example.

---oo0oo---

Page 2 of 2