Code: RA 9A05302a B.

Tech III Year I Semester (R09) Supplementary Examinations, May 2013 ADVANCED DATA STRUCTURES
(Electronics and Communication Engineering)

RA

Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) 2 (a) (b) 3 (a) (b) 4 (a) (b) 5 (a) (b) 6 (a) (b)

Max Marks: 70

What are the keywords used in C++ for exception handling? Describe their usage with suitable example. Write short notes on object pointers. Explain the concept of template class by writing a C++ program for linear search with template. Explain different type conversions in C++ with suitable examples. Implement list ADT. Write functions for insert and delete operations of a queue. Mention the difference between hashing and extendible hashing with example. What is the advantage of open addressing hashing? Explain. Differentiate between internal and external sorting. Explain any one external sorting method with suitable example. Write a C++ program to implement binary search tree. List the situations in which double rotations can be performed in an AVL tree. Explain them with suitable example. Compare indexed balanced tree with balanced binary tree. Give suitable example. Compare suffix trie with standard trie. Which one is better in saving memory space? Justify your answer.

7 8

*****