Introduction: Overview – How to create a Program and Analyze a program. Arrays: Axiomatization – ordered lists- Representation of arrays.

Stacks and Queues: Fundamentals –Mazing Problems - Evaluation of Expressions – Multiple Stacks and Queues.

Linked lists: Singly Linked Lists – Linked Stacks and Queues - Application: Sparse matrix - Doubly Linked Lists and Dynamic Storage management- Garbage collection and compaction.

Trees: Basic Terminology - Binary Tree and Binary tree representation – Binary Tree Traversals – Graphs: Terminology and representation –Definition – Graph representation-Depth first search and breadth first search- spanning trees and minimum cost spanning trees.

Searching: Liner and Binary search, Sorting: Insertion Sort – Quick Sort – Merge Sort – Heap Sort – shell sort.