| Chapter 1 | ADT C++ class;
Fundamental OOP principles; Algorithms and Performance Analysis in Big-Oh notations. |
| Chapter 2 | Arrays (1D, 2D, 3D) representations;
Sparse Matrix; String search pattern. |
| Chapter 3 | Stack and Queue operations;
Template class; Derived class; Dynamic array/Linked list implementation. |
| Chapter 4 | Linked list operations |
| Chapter 5 | Binary Tree Traversal;
Binary Search Tree operations; Max Heaps. |
| Chapter 6 | Graphs Representations (Adjacency
matrix and adjacency list)
DFS, BFS Minimum Cost Spanning Trees Shortest Paths |
| Chapter 7 | Internal Sorting: Selection, Insertion, Quick, Merge,
Heap
External Sorting: k-way merge sort |
| Chapter 8 | Static Hashing overflow handling: Linear search, double
hashing, and chaining
Dynamic hashing operations. |
| Chapter 10 | Search Structures
AVL trees definition and operations; 2-3 trees definition and operations; B-trees definition and operations |