Jawaharlal Nehru Technological University Hyderabad 2006 B.E Information Technology ADVANCED DATA STRUCTURE - Question Paper

Code No: R059210503 Set No. 1
II B.Tech I Semester Regular Examinations, November 2006
ADVANCED DATA STRUCTURE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: three hours Max Marks: 80
ans any 5 ques.
All ques. carry equal marks
? ? ? ? ?
1. (a) What is a local class? Why can it be useful?
(b) Can a copy constructor accept an object of the identical class as parameter,
instead of reference of the object?
(c) What is a class? What is an object?
(d) What is encapsulation? [4+4+4+4]
2. (a) When should my destructor be virtual?
(b) What is a “virtual constructor”?
(c) What’s the difference ranging from how virtual and non-virtual member functions
are called? [5+5+6]
3. (a) discuss about try, catch, throw keywords in C++?
(b) Write a program to illustrate the exception handling mechanism in C++.
[8+8]
4. Develop a C++ class twoStacks in which a single array is used to represent two
stacks. Put the bottom of 1 stack at 1 end of array and bottom of second
stack at the other end. The 2 stacks grow towards middle of the array. The class
should contain the methods to perform all operations of stack ADT. [16]
5. (a) discuss about the skip list representation of dictionary with an example?
(b) elaborate the data members of skipList class? Write the constructor for
skipList. [8+8]
6. describe a class called binarySearchTree to represent a Binary search tree. Extend
this class by adding a public method outputInRange (Low,High) that outputs,
in ascending order of key, all elements in a binary search tree whose key lies ranging from
Low and High. Use recursion and avoid entering sub trees that cannot possibly
contain any elements with keys in desired range. [16]
7. (a) define the B-trees? discuss the advantages of B-trees.
(b) Prove that let T be a red black tree with n interval nodes then no node has
depth greater than two log(n+1). [8+8]
8. (a) Write an algorithm of suffix tire ? calculate the performance of an algorithm.
(b) elaborate the properties of compressed trie. [10+6]
? ? ? ? ?
1 of 1



Code No: R059210503 Set No. 2
II B.Tech I Semester Regular Examinations, November 2006
ADVANCED DATA STRUCTURE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: three hours Max Marks: 80
ans any 5 ques.
All ques. carry equal marks
? ? ? ? ?
1. (a) discuss about the dynamic memory allocation and de-allocation in C++.
(b) discuss about static inner classes with a program. [8+8]

Earning:   Approval pending.