Code No: RT22053 R13 SET - 1
II B. Tech II Semester Supplementary Examinations, February - 2022
ADVANCED DATA STRUCTURES
(Com. to CSE, IT)
Time: 3 hours Max. Marks: 70
Note: 1. Question Paper consists of two parts (Part-A and Part-B)
2. Answer ALL the question in Part-A
3. Answer any THREE Questions from Part-B
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
PART –A
1. a) Differentiate between sets and dictionaries.
(3M)
b) Write short notes 2-3 trees.
(3M)
c) Explain about Binomial Amortized Analysis.
(4M)
d) What is spanning tree? Explain with an example.
(4M)
e) Classify about different types of complexities.
(4M)
f) Construct a Trie for the following String S={cat,bat,ball,rat,cap,be}.
(4M)
PART –B
2. a) Explain the about skip lists in detail with an example. (8M)
b) Perform the double hashing with the elements 8,26,37,51,11,18,22 with table (8M)
size 10.
3. a) Explain the rotations of AVL Tree with an example. (8M)
b) Write an algorithm to perform insertion of 2-3 tree. (8M)
4. a) Explain the implementation of Binary Heaps. (8M)
b) Write short notes on binomial queues with an example. (8M)
5. a) Discuss about Floyd-War shall algorithm in detail. (8M)
b) Apply the kruskals algorithm for above tree. (8M)
6. a) Write an algorithm to implement quick sort. (8M)
b) For the following elements 82, 901, 100, 12,150,77,55,23 perform radix sort. (8M)
7. a) Explain Knuth-Morris-Pratt algorithm. (8M)
b) Describe briefly about File processing operations. (8M)
1 of 1
|''|'|''|''|''|||'|| www.manaresults.co.in
