R09 - December, 2011 - Regular Examinations - Set - 4.

II B.Tech I Semester Examinations,December 2011
DATASTRUCTURES THROUGH C
Common to Information Technology, Computer Science And Engineering,
Electronics And Communication Engineering, Electrical And Electronics
Engineering
Time: 3 hours Max Marks: 75
Answer any FIVE Questions
All Questions carry equal marks
*****
1. (a) De ne queue. Discuss about the various representations of a queue
(b) What are the operations that can be performed on queue. [7 8]
2. (a) Explain how an AVL tree can be used to sort a sequence of n elements in O(n
log n) time.
(b) Why are binary search tree retrievals more e cient than sequential list re-
trievals? [15]
3. What is inheritance? Discuss about various types of inheritances with examples.
[15]
4. Describe about the pattern matching. List some of the pattern matching algo-
rithms. [15]
5. Explain in detail about polyphase merge with an example. [15]
6. Write about the extendable hashing with examples. [15]
7. Write a C program to create a graph. The graph is represented using Adjacency
Matrix. The program supports both undirected and directed graphs and traverse
the graph in DFS. [15]
8. (a) Explain how reusability is achieved in C .
(b) Explain the concept of object initialization in C . [7 8]
*****