Reg. No.
B.E. B.Tech. DEGREE EXAMINATION, MAY 2017
Third Semester
Electronics and Communication Engineering
01UCS323 DATA STRUCTURES AND ALGORITHM ANALYSIS
(Regulation 2013)
Duration: Three hours Maximum: 100 Marks
Answer ALL Questions.
PART A (10 x 2 20 Marks)
1. Define destructor.
2. Define operator overloading.
3. State the use of pointer.
4. What do you mean by stack unwinding?
5. Define Linked List. List the types of Linked List.
6. Write brief note on properties of binary heap.
7. Prove that the maximum number of nodes in a binary tree of height h is 2h 1.
8. Define Topological sort.
9. Write the steps involved in bucket sorting.
10. Define Divide and Conquer technique. Give an example.
Question Paper Code: 31203
2
31203
PART B x 16 80 Marks)
11. Design a matrix and vector classes with necessary properties. Write a program to multiply vector and matrix class objects using Friend function.
Or
Define constructor. Explain copy constructor with example.
Elaborate overloading binary operators with example program.
12. Illustrate the types of inheritance with suitable examples.
Or
Write a program to design a template for generic queue with their necessary operations.
13. Write a procedure to insert and delete an element in a single linked list.
Or
Given input {5179, 2345, 5425, 6173, 4199, 4344, 8796, 2411} and a hash function X mod 10, show the resulting
Separate chaining hash table
Open addressing hash table using linear probing
Open addressing hash table using quadratic probing
Open addressing hash table with second hash function 7-(xmod7).

14. Briefly explain single rotation and double rotation of AVL tree with examples.
Or
Write a routine to insert and delete an element in binary search tree.
15. Write a routine for merge sort and explain with an example.
Sort the following using shell sort.
18, 32, 12, 38, 33, 16, 2
Or
Write the routine for the quick sort and estimate its worst, average and best case time complexities. Also, sort the following key values using quick sort. 65, 70, 75, 80, 85, 60, 55, 50, 45.