| 13-3-2023 |
1.5 hours |
Ch 1 : Introduction: What Is an Algorithm? The place of algorithms in computer science and our everyday world, Designing Techniques, Model of Computation. |
|
|
|
1.5 hours |
What kinds of problems are solved by algorithms? Examples of Algorithms Ch 2 : Getting Started Insertion Sort , Analysis of Insertion Sort: Best Case Analysis Worst Case Analysis |
|
|
| 20-3-2023 |
1.5 hours |
Merge Sort Description of Merge Sort Examples of Merge Sort |
|
|
|
1.5 hours |
Performance of Merge Sort Analysis of Merge Sort |
|
|
| 27-3-2023 |
1.5 hours |
Ch : 3 Growth of Function Asymptotic Notations: Big Oh |
ASSIGNMENT 1 |
|
|
1.5 hours |
Big Theta, Big Omega, Standard Notations and common functions Ch : 4 Recurrences Master Method Examples of Master Method |
|
|
| 3-4-2023 |
1.5 hours |
Recursion Tree Method Examples, Ch : 6 Heap Sort Introduction to Heaps |
QUIZ 1 |
|
|
1.5 hours |
Substitution Method & Examples |
|
|
| 10-4-2023 |
1.5 hours |
Maintaining the heap property Max-Heapify Procedure Analysis of Max- Heapify Procedure |
|
|
|
1.5 hours |
Build a heap (Build Max-Heap procedure) Analysis of Build Max-Heap procedure The Heap-Sort Algorithm, |
|
|
| 17-4-2023 |
1.5 hours |
Ch: 7 Quick Sort Description of Quick Sort Examples |
|
|
|
1.5 hours |
Performance of Quick Sort Analysis of Quick Sort |
|
|
| 24-4-2023 |
1.5 hours |
Ch:8 Sorting in Linear Time Counting Sort Analysis of Counting Sort |
|
|
|
1.5 hours |
Radix Sort & Analysis, Bucket Sort & Analysis |
|
|
| 1-5-2023 |
1 Hour |
Mid Term |
|
|
| 8-5-2023 |
1.5 hours |
Ch : 15 Dynamic Programming Element of the dynamic programming |
|
|
|
1.5 hours |
Matrix Chain Multiplication |
|
|
| 15-5-2023 |
1.5 hours |
MidTerm |
|
|
|
1.5 hours |
MidTerm |
|
|
| 22-5-2023 |
1.5 hours |
Ch: 16 Greedy Algorithms Activity Selection Problem |
|
|
|
1.5 hours |
Element of the greedy strategy |
|
|
| 29-5-2023 |
1.5 hours |
Ch : 22 Elementary Graph Algorithms Representation of graph |
|
|
|
1.5 hours |
Breadth-First Search |
|
|
| 5-6-2023 |
1.5 hours |
Ch : 23 Minimum Spanning Tree Growing a Minimum Spanning Tree |
ASSIGNMENT 2 |
|
|
1.5 hours |
Kruskal’s Algorithm Example |
|
|
| 12-6-2023 |
1.5 hours |
Prim’s Algorithm Example |
QUIZ 2 |
|
|
1.5 hours |
Kruskal’s Algorithm Example |
|
|
| 19-6-2023 |
1.5 hours |
Ch : 24 Single-Source Shortest Paths |
|
|
|
1.5 hours |
Single-Source Shortest Paths in DAG Dijkstra’s Algorithm |
|
|
| 26-6-2023 |
1.5 hours |
Bellman-Ford Algorithm |
|
|
|
1.5 hours |
Floyd-Warshall Algorithm |
|
|
| 3-7-2023 |
2 Hour |
Final Term |
|
|
