NOTICE

The syllabus for ST-2 for

Course Name: Data Structures
Course Code: CSL5210
1

Stacks & Queues: Array and Linked representation

of Stacks,

Implementations of recursive and non recursive

procedures by Stacks,

Applications: Arithmetic Expressions

TB1
RB1

6.9-6.11
111-113

Polish Notation: Evaluation of Arithmetic

Expressions

TB1
RB1

6.9-6.11
111-113

Transforming Infix Expressions into Postfix

Expressions

TB1
RB1

6.11-6.14
114-125

Queues : Representation as Array and Linked List,

Deques, Priority Queues

TB1
RB1

6.32-6.43
190-200

Sorting Techniques-Quick sort , Merge Sort , Radix

Sort, Selection Sort, Insertion Sort & their
complexity,

TB1

6.14-6.18
9.2-9.18

RB1

Trees: Binary trees, complete binary trees,

TB1
Link1

358-366
381-382
389-397
7.1-7.4

Binary Search Trees, Data structures for

representing binary trees.

TB1

Course Co-ordinator:
Ankita Tuteja

TB1
RB1
Link1
TB1
RB1

6.1-6.8
93-101
6.26-6.31
102-111

7.5-7.9