Introduction to Data structures, linear structures, and Dynamic structures. Arrays, Queue, Stack, Stack Operations, Lists – Singly-linked lists, doubly linked lists and circular linked lists. Operations on linked list (Traversal, Deletion, Insertion).
Searching and Sorting Algorithms. Complexity Analysis. Hashing, Hash structures like Hash tables, Hash Set, Trees – binary trees, binary tree basic algorithms and traversals (In-order, Pre-order, -Order). Graphs – Binary Search Trees (BSTs) representation and traversal (insertion, deletion). Heaps and heap sort, Graphs, Breadth First, Depth first, topological sort, shortest path algorithm.