Introduction: Data structures – Types of Data structures –Data structure operations – Abstract data type- Analysis of algorithms – Amortized Analysis. Arrays: Introduction – Characteristics of Arrays – One-dimensional Arrays – Operation with Arrays – Two-dimensional Arrays – Multi-dimensional Arrays.

Stack – Definitions – Concepts – Operations on Stacks – Infix, postfix & prefix conversions - evaluations of expressions using stack - Applications of stacks – Representation of Queue – Insertion and Deletion Operation – Applications of Queue.

Lists – Linked List – Singly linked list – doubly linked list – Circular linked list –Representation of Stacks using linked lists – Representation of Queues using linked lists– Applications of Linked list

Bubble sort - Insertion sort – Selection sort – Quick sort – Merge sort – Radix sort – Heap sort. Trees: Trees – Binary Trees – Operations on Binary Trees –Traversal of a Binary Tree – Threaded Binary Tree - Binary Search Trees (BST) – Inserting and Deleting in a BST.

Graphs – Representation of graph – Traversal in Graph – Spanning Trees - Prim’s and Kruskal’s algorithm – Dijkstra’s algorithm for shortest path problem.