R09 - December, 2011 - Regular Examination - Set - 2

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) Explain about the Compressed trie with an example.
(b) Calculate the failure function in a Search string
\ABACAABADCABACABAABB". [15]
2. (a) What are the advantages and disadvantages of open addressing.
(b) Write the algorithm for open addressing. [7 8]
3. Describe about the graph search methods. [15]
4. Create the heap to sort the following list of numbers.
5, 18, 20, 9, 4, 15, 10, 30, 8, 45, 2, 22, 55, 63, 14, 72, 17. [15]
5. Explain di erent types of exception handling mechanisms with examples. [15]
6. Write a C program to implement queue using arrays. [15]
7. Di erentiate function template and class template. How these templates can access
the generic function? [15]
8. Explain in detail deletion of an element in BST in di erent cases. [15]
*********