SRM IST · Regulations 2025

Semester I
PCA25C02T
Cycle Test 1

PCA25C02T · Cycle Test 1

Data Structures and Algorithms

Max marks: 50

Cycle Test 1 Cycle Test 2 Model Exam End Semester

Covers units 1 & 2: Introduction / Stack, Queue and Tree

Part-A (4*5=20 Marks)

Answer Any 4 Questions

1.
Discuss about Asymptotic Notations.
5mCO1BL2
2.
Define data structures and list the types of data structures with examples.
5mCO1BL1
3.
Write about the complexity of Algorithm.
5mCO1BL1
4.
Discuss the Polish notations in data structures with examples.
5mCO2BL2
5.
How Queue can be considered as ADT? List the operations on Queue.
5mCO2BL2
6.
Write the implementation of double ended queue with example.
5mCO2BL2

Part-B (2*15=30 Marks)

Answer all the Questions

7.a)
Describe about Arrays, Representation, and Array Operations in detail.
15mCO1BL2
OR
b)
Describe in detail the structure of a singly linked list with its operations.
15mCO1BL2
8.a)
Discuss about the Implementation of Stack with suitable algorithms.
15mCO2BL2
OR
b)
Describe in detail the various types of Tree Traversal algorithms.
15mCO2BL2