| # | Lecture Slides | Laboratory Practical |
|---|---|---|
| 1 | Unit 01 - Review of OO Concepts | Review related Labs |
| 2 | Unit 02 - Introduction to Design Patterns | Lab 01 - Introduction to Design Patterns (Lab Document, Code Files) |
| 3 | Unit 03 - Complexity Analysis I | Lab 02 - More on Design Patterns (Lab Document, Code Files) |
| 4 | Unit 04 -Complexity Analysis II | Lab 03 - Linked Lists (Lab Document, Code Files) |
| 5 | Unit 05 - Singly Linked List | Lab 04 - Stacks and Queues (Lab Document, Code Files) |
| 6 | Unit 06 - Doubly Linked List | Lab 05 - Recursion (Lab Document, Code Files) |
| 7 | Unit 07 - Stack | Lab 06 - Binary and Binary Search Trees (Lab Document, Code Files) |
| 8 | Unit 08 - Queue | Lab 07 - Binary Heaps (Lab Document, Code Files) |
| 9 | Unit 09 - Recursion 1 | Lab 08 - Huffman Coding (Lab Document, Code Files) |
| 10 | Unit 10 - Recursion 2 | Lab 09 - Trees (Lab Document, Code Files) |
| 11 | Unit 11 - Recursion 3 | Lab 10 - Graph (Lab Document, Code Files) |
| 12 | Unit 12 - Analysis of Recurvise Algorithms | Lab 11 - Graph Algorithms (Lab Document, Code Files) |
| 13 | Unit 13 - Introduction to Trees | Lab 12 - Hashing (Lab Document, Code Files) |
| 14 | Unit 14 - Binary Search Trees (BSTs) | |
| 15 | Unit 15 - Tree Traversal | |
| 16 | Unit 16 - Binary Heaps | |
| 17 | Unit 17 - AVL Tree 1 | |
| 18 | Unit 18 - AVL Tree 2 | |
| 19 | Unit 19 - B-Trees | |
| 20 | Unit 20 - Application of Trees: Huffman Coding | |
| 21 | Unit 21 - Introduction to Graphs | |
| 22 | Unit 22 - Graphs Implementation | |
| 23 | Unit 23 - Graph Traversal | |
| 24 | Unit 24 - Topological Sort | |
| 25 | Unit 25 - Graph Connectedness and Cycles | |
| 26 | Unit 26 - Shortest Path Algorithms | |
| 27 | Unit 27 - Minimum Spanning Trees | |
| 28 | Unit 28 - Hashing 1 | |
| 29 | Unit 29 - Hashing 2 | |
| 30 | Unit 30 - Hashing 3 | |
| 31 | Unit 31 - Data Compression - LZ78 | |
| 32 | Unit 32 - Data Compression - LZW | |
| 33 | Unit 33 -Garbage Collection | |
| 34 | Unit 34 - Memory Management |