Name of the Subject: ADVANCED DATA STRUCTURS

Unit-I

Q.
Questions
No
A) Compare External and Internal Sorting ?
1
B) List out External storage devices and Explain. How these are used in External sorting.
A) Describe merge sort technique and explain K-way merging with example.
B) Consider 3 runs with 4 records solve step-by- step process of merging the three runs using
2
3-way merge sort technique.
Run1 : 3 5 12 15 Run2 : 2 4 10 17 Run3 : 1 6 8 18
A) Explain Buffer Handling for parallel operation with example.
3
B) Write an algorithm to find length or size of linear list in dictionaries.
Develop algorithms to implement following operations of Dictionary.
4
a) Insert b) Delete c) find
A) Describe the Optimal Merging of runs with suitable example.
5
B) Distinguish between Buffer Handling for parallel operation with optimal merging of runs.
A) Define Dictionaries and basic operations in Dictionaries. Write ADT for Dictionaries.
6
B) Write an algorithm to Erase a node in the dictionary.
A) List the applications of Dictionaries.
7
B) Explain Poly phase merge algorithm with an example.
A) Compare with an example one way merge and k way merge.
8
B) Write an algorithm to insert a new node in the dictionary.
Develop a program to implement following operations of Dictionary?
9
a) Insert b) Delete c) find
A) Explain representation of dictionaries with neat diagrams .
10
B) Develop an algorithm to implement search operation in the dictionary.

Unit-II

Q.
Questions
No
A) Define Hash table , Hash function , Bucket and Home Bucket.
1 B) Define collision with example. Write characteristics of good hashing function.

A) Explain any 3 methods that are used to calculate hash function.

2
B) Explain collision resolution technique methods with examples.
Explain Linear probing and quadratic probing with example.
3
Explain about double hashing with example in detail.
4
A) Explain hashing with chains. Write Comparisons with linear probing.
5
B) Define loading factor. Where it can be used? Explain with example.
A) State the advantages and disadvantages of separate chaining?
6 B) Solve the following keys in the hash table using linear probe
131,4,8,7,21,5,31,61,9,29
A) Explain modulo division and digit extraction hashing methods with an example.
7
B) Define table size of a hash table. List the types of hash function.
 A) Define Rehashing technique? Describe with an example.
8
B) How will you handle overflow and collision detection in a hash table? Discuss methods.
A) Define Extendible Hashing? Explain operations in Extendible Hashing with example.
9 B) Construct the open hash table and closed hash table for the input:
30, 20, 56, 75, 31, 19 using the hash function h(k)= k mod 11
A) Define open addressing? List the types of open addressing hashing?
10
B) Define separate chaining hashing? List the Applications of hashing?

Unit-III

Q.
Questions
No
A) Define Binary Heap ? List out properties of Binary Heap.
1
B) Define AVL tree ? List out properties of AVL trees.
A) List out operations on binary heap? Write the snippet of insertion operation on binary heap?
2
B) Construct the min.Heap using the data D,A,T,A,S,T,R,U,C,T,U,R,E,S.
Explain Heap sort algorithm with an example.
3
A) List out the operations in AVL tree? Explain each.
4
B) Define Binomial Queue ? List out the properties of Binomial Queues.
A) Brief the properties of AVL trees. Explain the deletion operation with example.
5
B) Discuss delete operation on binomial queue with neat sketch in detail.
A) List out double rotation operations in AVL tree ? Explain each.
6 B) Discuss differences between AVL tree and Binary Search Tree . List out other balanced
trees.
A) Develop a diagram to Insert the values from 1-10 using AVL tree concept.
7
B) Develop an algorithm to insert and delete an element in the heap.
A) Construct the max heap for following keywords goto, if, else, printf, scanf, for, while, case,
8 switch, continue.
B) Write down ADTs for priority Queues.
Discuss the need of rotations in AVL-tree and explain various rotations in detail.
9
A) Discuss insert operation on binomial queue with neat sketch in detail.
10
B) Explain Min. Heap and Max. Heap with example.

Unit-IV

Q.
Questions
No
A) Illustrate the properties of BST and RED-BLACK Trees with examples.
1
B) Define splay tree? List out operations in splay trees. Mention other names also for operations.
A) Explain the each operation to insert an element in to RED-BLACK trees with example.
2
B) Explain LL,RR,LR,RL complex rotations in Splay Trees.
A)Write an algorithm to search an element in the RED-BLACK tree.
3
B) Construct Splay Tree with the following data 7,6,5,4,3,2,1.
A) Discuss the Deletion operation from a RED-BLACK tree.
4
B) Define Multiway Search Tree ? Explain Search operation in Multiway Search Tree.
A) Explain single rotations in Splay Trees with an example.
5 B) Create a 2-3 tree from the following list of data items:
5,6,8,21,12,30,34,27,23,4,33,7,24,9,10,11,13,38
 A) Explain various types of imbalances occurred while deleting a node in RED-BLACK Tree.
6
B) Where the situation LL and RR operations required in Splay Trees? Explain with example.
A) Illustrate the rules for RED-BLACK Trees and Splay Trees.
7
B) Explain the representation of Splay Trees with example.
A) Write an algorithm to perform insert and delete operations in Multiway Search Tree.
8
B) Explain the representation of Data structure RED-BLACK Trees.
A) Distinguish between RED-BLACK and Multiway Search Trees.
9
B) Give the applications of RED-BLACK ,Splay Trees.
A) Create a RED-BLACK TREE by inserting following sequence of numbers
10 8,18,5,15,17,25,40 & 80.
B) Discuss about splay trees in detail.

Unit-V

Q.
Questions
No
A) Define B-Tree ? List out the properties of B-Tree.
1
B) Explain the insertion algorithm in Digital Search Trees.
A) Write an algorithm to search an element in B-Tree.
2
B) Explain the compressed trie with an example.
A) Define B+ Tree ? List out the properties of B+ Trees.
3
B) List out differences between standard trie and suffix trie.
A) Write an algorithm to search an element in a B+ Tree.
4
B) Explain two kinds of nodes in Binary trie.
Explain operations on B – trees with examples.
5
A) Write an algorithm to insert an element in B-Tree. Construct a B-Tree of Order 3 by
6 inserting numbers from 1 to 10.
B) Explain different types tries with example.
A) Explain the search and deletion algorithm in Digital Search Trees.
7
B) Write an algorithm to insert an element in to B+ Tree.
A) List out differences between B - Tree with B+ Tree.
8
B) Define Tries ? list out the Advantages and Applications of tries.
A) Write an algorithm to delete an element from B-Tree.
9
B) List out differences between Digital Search Trees and Tries.
A) Write an algorithm to delete an element from the B+ Tree.
10
B) Construct the compact representation of the suffix trie for the string minimize minima