Code No: M5802/R19

M. Tech. I Semester Regular/Supplementary Examinations, July/August-2021

Advanced Data Structures & Algorithms/Advanced Data Structures
Common to CS&E (58) and SE (25)
Time: 3 Hours Max. Marks: 75
Answer any FIVE Questions One Question From Each Unit
All Questions Carry Equal Marks

UNIT-I
1. a What are circular linked lists? Give the advantages of them over single linked lists? 6
b Define a stack? Show how to implement three stacks in one array? 9
OR
2. a Write an array implementation of self-adjusting lists. In a self-adjusting list, all 9
insertions are performed at the front. A self-adjusting list adds a find operation,
and when an element is accessed by a find, it is moved to the front of the list
without changing the relative order of the other items.
b Describe how the deletions and insertions performed in double linked lists? 6
UNIT-II
3. a What is a graph? Describe various ways to represent graphs in system memory? 8
b Give the prefix, infix, and postfix expressions corresponding to the tree in the 7
following figure.

OR
4. a Illustrate graph traversal techniques with an example? 7
b Explain the working principle of in-place quick sort? 8
UNIT-III
5. a Write a program to implement extendible hashing. If the table is small enough to 8
fit in main memory, how does its performance compare with separate chaining and
open addressing hashing?
b What is an Abstract Data Type? Define and describe Queue ADT. 7
OR
6. a Show the result of inserting the keys 10111101, 00000010, 10011011, 10111110, 8
01111111, 01010001, 10010110, 00001011, 11001111, 10011110, 11011011,
00101011, 01100001, 11110000, 01101111 into an initially empty extendible
hashing data structure with M = 4.
b What are the advantages and disadvantages of the various collision resolution 7
strategies?

1 of 2

|''||''||''||''''|||
Code No: M5802/R19

UNIT-IV
7. a Show the result of inserting 3, 1, 4, 6, 9, 2, 5, 7 into an initially empty binary 6
search tree and show the result of deleting the root.
b What is a priority queue? Implement priority queues using heaps. 9
OR
8. a What is a complete binary tree? Which tree traversal method is more suitable for 5
complete binary tree.
b Write a function illustrating deletion from a Binary Search Tree( Describe all 10
possible cases in detail).
UNIT-V
9. a Write a non-recursive function to insert into an AVL tree. 7
b Write a routine to perform deletion from a B-tree. 8
OR
10. a Write a routine to perform deletion in AVL trees? 8
b What is a splay tree? Discuss Zig-Zag rotation and Analyze its time complexity. 7

*****
2 of 2

|''||''||''||''''|||