Reg Now ↽↼≓↽ ⋂≤≳⋯⋁∣∁⋀⋯≤∣≳∐∍∘↾↾∶≓↼↼⋅⋅⊀
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

First Semester MCA (2 Years) Degree Examination December 2020 (2020 Scheme)

Course Code: 20114105
Course Name: ADVANCED DATA STRUCTURES

Max. Marks: 60 Duration: 3 Hours

PART A
Answer all questions, each carries 3 marks. Marks
[ Define binary search tree. (3)
2 What is Disjoint Sets? Explain with an example. (3)
3 What is Splay Tree? List the Rotations in Splay Tree. (3)
4 Explain the concept of suffix tree with suitable example. (3)
5 What is the difference between min heap and max heap? (3)
6 What is mergeable heap? (3)
7 Describe adjacency matrix representation of a graph. (3)
8 What are strongly connected components in a graph? Explain with an example. (3)
9 What is blockchain data structure? (3)
10 What is smart contract in Block chain? (3)
PART B
Answer any one question from each module. Each question carries 6 marks.
Module I
11 What is hashing? Explain the different hash functions. (6)
OR
12 Explain amortised analysis using accounting method. (6)
Module II
13 Explain Red-Black tree insertion operations with examples. (6)
OR

Page 1 of 2