Dr.A.P.J.Abdul Kalam University BE III SEM ALL BRANCH DEC 2020 Data Structure-II [CS-223] Dec - 2020 Question Paper

Dr.A.P.J.Abdul Kalam University Old Question Papers

Bachelor of Engineering

Third Semester Main Examination, Dec-2020

Data Structure-II [CS-223]

Branch- CS

Time: 3:00 Hrs Max Marks 70

Note : (i) Attempt any five questions.

(ii) All question carry equal marks.

Q.1 (a) What do you understand by Asymptotic notation? Explain each notation with example and

diagram.

(b) Explain different non primitive data structure and the operation associated with them.

Q.2 (a) Explain various algorithm used in data structure.

(b) Provide the solution for the following recurrences:

T(n ) 2T(n/2) + n log n

Q.3 Explain the AVL tree insert method and explain. Why its insertion time complexity is still of the

same order as binary tree?

Q.4 (a) Construct an AVL search tree by inserting the following element in order of their occurrence

64, 1, 44, 26, 13, 110, 98, 85

(b) Explain analysis of Heap operation with example.

Q.5 (a) What is a stable sorting algorithm? Also prove counting sort is stable.

(b) Explain outline and offline algorithm.

Q6. (a) What do you understand by data structure maintenance? Explain.

(b) Explain Augmentation strategy with example.

Q.7 (a) Write short note on Internal trees. Explain with example.

(b) Explain retrieving an element with a given rank.

Q.8 (a) Explain Quick sort? Sort the following elements using Quick sort:

32, 23, 56, 78, 12, 66, 37, 93, 29, 80

(b) Write a short notes:

(i) Comparison of indexing and hashing

(iii) Insertion sort

Attachment & Scanned Copies: