Jawaharlal Nehru Technological University Anantapur 2011-1st Sem B.Tech Computer Science and Engineering II Computer Science & Engineering ester(R09) Supplementary s, "Advanced Data Structures" - Q

Code :9A05302
II B.Tech I Semester(R09) Supplementary Examinations, May 2011
ADVANCED DATA STRUCTURES
(Computer Science & Engineering)
Time: three hours Max Marks: 70
ans any 5 ques.
All ques. carry equal marks

1. (a) What is a friend function? elaborate the merits and demerit of using friend function?
(b) discuss the diff erent kinds of constructors in C++.
2. (a) What is Dynamism? discuss any 3 types of dynamism for object-oriented design with an
example for every.
(b) What is Compile time polymorphism? discuss with an example.
3. (a) What characteristics should a good algorithm possess?
(b) Analyse the time and space complexity for recursive binary search algorithm.
4. (a) define kind declaration for separate chaining hash table.
(b) explain Linear Probing.
5. With suitable diagram, discuss the principle of Priority Queue.
6. (a) provide the linked list representation of a binary search tree. elaborate the operations performed on
a binary tree.
(b) It is needed to build a binary search tree with a set of data. Write a function for inserting an
item into a binary search tree. Use this function to build a tree from a provided set of data as input.
7. (a) discuss about Splay trees.
(b) Write short notes on B-trees.
8. discuss Brute force algorithm with example. Also write a C++ program to implement it.

Earning:   Approval pending.