B 0800CST201122005 Pages: 2

Reg No.: Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Third Semester B.Tech Degree Examination December 2020 (2019 Scheme)

Course Code: CST201
Course Name: DATA STRUCTURES

Max. Marks: 100 Duration: 3 Hours
PARTA
Answer all questions. Each question carries 3 marks Marks
1 What is frequency count? Explain with an example. (3)
2 Derive the Big O notation for f(n)= 3124217. (3)
3 Write any three applications of Stack. (3)
4 Explain PUSH and POP operations in stack. (3)
5 What is dynamic memory allocation? List any two advantages of dynamic (3)
memory allocation.
6 Write an algorithm to count number of nodes in a singly linked list. (3)
7 Write the output of inorder, preorder & postorder traversals on the following (3)
tree.

8 Differentiate between complete binary tree and full binary tree. Give examples (3)
for each.
9 Explain Max Heap with an example. (3)
10 What is hashing? List any two applications of hashing. (3)
PART छ
Answer any one full question from each module. Each question carries 14 marks
Module 1
118) Explain the System Life Cycle in detail. (10)
b) What are asymptotic notations? Give examples. (4)

Page | of 2