- Practical Exercises through Oj-system
| Week | Practice | Practice Topic |
|---|---|---|
| 1 | Data Structure | Linked List / Binary Tree |
| 2 | Priority Queue | Selection Sort / Insertion Sort |
| 3 | Heap | Insertion Heap / Top-Down Heap |
| 4 | Heap Sort | Unique Keys / Duplicate Keys |
| 5 | Sorting | Merge Sort / Quick Sort |
| 6 | Dictionary | Binary Search (Recursive / Non-recursive) |
| 7 | Search Tree | Binary Search Tree / AVL Tree |
| 9 | Hash Table | Disjoint Chaining / Open Address Method (Linear Probing / Double Hashing) |
| 10 | Graph | Adjacency List / Adjacency Matrix |
| 11 | Graph Traversal | DFS / BFS |
| 12 | Directed Graph | Topological Ordering |
| 13 | Minimum Spanning Tree | Prim's Algorithm / Kruskal's Algorithm |
| 14 | Shortest Path | Shortest Distance in Undirected / Directed Weighted Graphs |