UNIT 1…………………………………………………… 7
Introduction to Data Structure, Algorithm Notations and Analysis of Algorithm
1.1 Introduction to Data Structure
1.2 Types of data structure – 1. Primitive 2. Non Primitive 3. Linear
4. Non linear
1.3 Need of data structure
1.4 Algorithm Notations – a. Format Convention b. Name of Algorithm
c. Introductory Comment d. Steps e. Comments
1.5 Time analysis of an algorithm
1.6 Space analysis of an algorithm
UNIT 2…………………………………………………………. 16
Stacks
2.1 Definition and concept
2.2 Representations – static
2.3 Operations – push, pop, peep, change
2.4 Applications – infix to postfix, postfix evaluation, Recursion using stack
UNIT 3…………………………………………………………. 33
Queues
3.1 Definition and Concept of Queue
3.2 Representation – static
3.3 Operations- Insert, Delete
3.4 Circular queue : Concept, Operations – insert, delete
3.5 DeQue : Concept
3.6 Priority queues : Concept UNIT 4………………………………………………………. 45
Link List
4.1 Introduction to Linked list
4.2 Implementation of List – Dynamic representation.
4.3 Types of Linked List – a. Singly Linked list : Operations- Insert, delete b. Circular linked list : Operations- Insert, delete c. Doubly
linked linear list : Operations- Insert, delete
4.4 Applications of linked list – polynomial manipulation
Practicals……………………………………………………………. 63
