Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list implementation – Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications of lists

Stack ADT – Array and Linked list implementation of Stack Operations – Balancing Symbols – Infix to Postfix conversion – Evaluating arithmetic expressions - Function Calls – Queue ADT – Array and Linked list implementation of Queue Operations – Circular Queue – Applications of Stack and Queues in Operating systems.

Tree ADT – Tree Traversals – Binary Tree ADT – Expression trees – Binary Search Tree ADT – Balanced Binary Trees - AVL Trees – Priority Queue (Heaps) – Binary Heap.

B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph – Graph Traversal techniques - Breadth-first traversal – Depth-first traversal –– Bi-connectivity and its Real-world applications – Euler circuits – Topological Sort – Dijkstra’s algorithm – Minimum Spanning Tree – Prim’s algorithm – Kruskal’s algorithm – Applications of graphs in Networking

Searching – Linear Search – Binary Search – Sorting – Bubble sort – Quick sort – Insertion sort –Merge Sort – Hashing – Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing.