Scribd
Upload
24 views

Advanced Data Structures (1)

Uploaded by

redragon165
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
24 views

Advanced Data Structures (1)

Uploaded by

redragon165
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

H.T.No.

Code No: CT3533 SRGEC-R20


III B.Tech I Semester Supplementary Examinations, July 2024
ADVANCED DATA STRUCTURES
(Computer Science and Engineering, Artificial Intelligence and Machine Learning & Information
Technology)
Time: 3 Hours Max. Marks: 70
Note: Answer one question from each unit.
All questions carry equal marks.
5 × 14 = 70M
UNIT-I
1. a) Explain with an example finding the mean and order statistics in linear time. (7M)
b) A file of 2300 records is to be sorted. Assume that the internal memory can hold a
maximum of 500 records at a time. Explain how this file is sorted using external sorting
by giving necessary pictorial representation for run generation and merging. (7M)
(OR)
2. a) Write the step by step process to construct the Huffman tree. Suppose we have the
weights q1=4, q2=5, q3=7, q4=8, q5=10, q6=12 and q7=20. Construct a Huffman tree for
the given data and calculate the weighted external path length of the generated Huffman
tree. (7M)
b) Develop an algorithm to calculate the minimum value from a given list of n elements, also
calculate the number of comparisons required. (7M)
UNIT-II
3. A priority queue can be implemented using an array and linked list. Discuss this with suitable
illustrations. (14M)
(OR)
4. A heap is a complete or nearly complete binary tree. Discuss this with a suitable example.
Justify which among the following given trees are heaps and which are not. (14M)

UNIT-III
5. What is an AVL tree? Write the properties of an AVL tree. Explain different rotations that are
applied during insertion operation on an AVL tree with examples. (14M)
(OR)

Page 1 of 2
6. What is a splay tree? Explain various rotations applied on a splay tree during an insertion
operation with examples. (14M)
UNIT-IV
7. Define a B-Tree of order m. Start with an empty B-Tree of order 4 and insert the following
keys: 21, 11, 51, 61, 71, 41, 31, 81, 91, 101 and 111. Draw the B-Tree of order 4 after each
insertion. (14M)
(OR)
8. Define an m-way search tree. Describe the properties of m-way search trees. Give example for
7-way search trees. Show how insertion, deletion and search operations can be done on this 7-
way search tree. (14M)
UNIT-V
9. Write about Digital Search Tree. Start with an empty Digital Search Tree and insert the given
elements in the given order and draw Digital Search Tree for every insertion:
0011, 1011, 1100, 0100, 0110, 0001, 1010, 0101.
From the tree constructed, delete the keys: 0100, 0110, 0101 (14M)
(OR)
10. a) With a suitable example describe the procedure for insertion of a node into a Binary Trie.
(7M)
b) Discuss about Multi-way Tries with an example. (7M)

*****

Page 2 of 2

You might also like