Introduction and Overview: Definition, Classification and Operations of Data
Structures. Algorithms: Complexity, Asymptomatic Notations, Time-Space Trade off.

Arrays: Definition and Classification of Arrays, Representation of Linear Arrays in
Memory, Operations on Linear Arrays: Traversing, Inserting, Deleting.

Two-Dimensional Arrays, Representation of Two Dimensional Arrays in Memory,
Matrices and Sparse Matrices, Multi-Dimensional Arrays.

Linked Lists: Definition, Comparison with Arrays, Representation, Types of Linked
lists, Traversing, Inserting, Deleting and Searching in Singly Linked List, Doubly
Linked List and Circular Linked List. Applications of Linked Lists

Stacks: Definition, Representation of Stacks using Arrays and Linked List, Operations
on Stacks, Application of Stacks: Arithmetic Expressions, Polish Notation, Conversion
of Infix Expression to Postfix Expression, Evaluation of Postfix Expression.

Recursion: Definition, Recursive Notation, Runtime Stack, Applications of Recursion:
Factorial of Number, GCD, Fibonacci Series and Towers of Hanoi.

Queues: Definition, Representation of Queues using Array and Linked List, Types of
Queue: Simple Queue, Circular Queue, Double-Ended queue, Priority Queue,
Operations on Simple Queues and Circular Queues using Array and Linked List,
Applications of Queues.