Code: 9A05302 II B.

Tech I Semester (R09) Regular & Supplementary Examinations, November 2011 ADVNACED DATA STRUCTURES
(Common to ECC, CSS, IT, & CSE)

Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) 2 (a) (b) 3 (a) (b) 4 (a) (b) (c) 5 (a) (b) 6 7 Proce 8 Explain the loop structures available in C++. Write a program to print prime numbers between two limits. Explain in detail about operator overloading. Write a note on virtual base classes with examples. Define data structure. List out various types of data structures. Describe in detail the array implementation of queues. Short notes on Hash function. Separate chaining. Double hashing. Differentiate between internal and external sorting. Explain any one external sorting method with suitable example. Write a C++ program to implement AVL tree and its operations.

Max Marks: 70

Explain the operations: insertion, deletion and searching in B-tree. Also write the procedure to find height of B-tree. Analyze the running time of Boyer Moore algorithm. *****

Code: 9A05302 II B.Tech I Semester (R09) Regular & Supplementary Examinations, November 2011 ADVNACED DATA STRUCTURES
(Common to ECC, CSS, IT, & CSE)

Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1 2 (a) (b) (c) 3 (a) (b) (c) 4 (a) (b) (a) 5(a) (b) 6 (a) (b) 7 (a) (b) 8 Compare and contrast between splay tree and B-tree. What are Tries? Explain the following: Standard Tries. Compressed Tries. Suffix Tries.

Max Marks: 70

Write a C++ program to perform 2D matrix operations as follows: Define class MATRIX, use appropriate constructor. Define methods for the following two matrix operations: determinant and transpose. Write a main program to demonstrate the use of the MATRIX class and its methods. What is Dynamism? Explain any three kinds of dynamism for object-oriented design with an example for each. What is Compile time polymorphism? Explain with an example. Differentiate between the terms linear and non linear data structures. Explain the working of stacks and queues taking suitable examples. Explain how a hashing table can be represented? Describe any two hashing functions with example. Define ascending and descending heap. Trace heap sort algorithm for 20, 33, 12, 22, 11, 34, 56, 30, 40. Explain any one external sorting method with example. List the situations in which single rotations can be performed in an AVL tree. Explain them with suitable example. *****

Code: 9A05302 II B.Tech I Semester (R09) Regular & Supplementary Examinations, November 2011 ADVNACED DATA STRUCTURES
(Common to ECC, CSS, IT, & CSE)

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

Max Marks: 70

What are constructors and destructors? Explain how they differ from normal functions? Illustrate with an example. How does a structure in C and C++ differ? Explain with example. What is Containership? How does it differ from Inheritance? Write a function template for finding the minimum value contained in an array.

3 (a) Explain the linked list implementation of stack and write the procedures for its operations. (b) Describe big O notation used in algorithms. 4 (a) (b) Explain the functionality of linear and quadratic probing with respect to hashing technique. The following values are to be stored in a hash table 25, 42, 96, 101, 102, 162, 197, 201 Use division method of hashing with a table size of 11. Use sequential method of resolving collision. Give the contents of array. Discuss how deletions are carried out in priority queue. Write notes on external sorting. What is binary search tree? Construct the binary search tree for the following data 21, 6, 9, 4, 17, 24, 12, 10, 35, 31, 30, 13. What is the advantage of BST over a binary tree? Write notes on balanced trees. Explain about Red-black trees with example. Write a C++ program to implement Red-black tree operations. Analyze the time complexity of Knuth-Morris-Pratt algorithm. *****

5 (a) (b) 6 (a) (b) 7 (a) (b) 8

Code: 9A05302 II B.Tech I Semester (R09) Regular & Supplementary Examinations, November 2011 ADVNACED DATA STRUCTURES
(Common to ECC, CSS, IT, & CSE)

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 6 7 (a) (b) (c) 8 (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. Explain the big Oh notation. Compare recursion with iteration. Give example. Explain about the basics of Hashing technique. Differentiate between open hashing and closed hashing. Explain in detail about priority queues and external sorting. Write notes on AVL trees. Explain the following basic splay tree operations: Insertion. Deletion. Searching. Explain the following pattern matching algorithms: Brute force algorithm. Knuth-Morris-Pratt algorithm. *****