Monday, 09:15-11:00
Theory Exam: 22nd January, 8:30-10:30 AM
Programming Exam: 29th January, 9:30-12:30 AM
| Dec 18 | Session-12 |
MST, TST Approximation with MST, HS-21 Exam |
| Dec 11 |
Session-11 |
BFS, Dijkstra Time Complexity, Bellman Ford, 0-1 BFS |
| Dec 4 |
Session-10, Notes_Exercise-10 |
Eulerian Cycle in Multi-Graph, DFS Pre/Post-Order, Forward/Backward/Cross-Edges, SCC, Dijkstra, BFS in 2D Maze |
| Nov 27 | Session-9, Notes_Exercise-9 |
DAGs, Topological Sorting, Data Structures for Graphs, DP on DAGs, Cycle Detection with DFS |
| Nov 20 | Session-8, Notes_Exercise-8 |
Eulerian Walk/Cycle, Hamiltonian Path/Cycle, Graph Terminology, Tree Definitions, Proofs in Graphs |
| Nov 13 |
Session-7, Notes_Exercise-7 |
Knapsack DP and Variations |
| Nov 6 |
Session-6, Notes_Exercise-6 |
Tree Terminology, AVL Tree, Stacks, DP |
| Oct 30 |
Session-5, Kahoot, Notes_Exercise-5 |
Binary Search Revisited, Decision Trees, Data Structures, AVL Tree, Min Edit Distance, Longest Common Substring |
| Oct 23 |
Session-4, Kahoot, Notes_Exercise-4 |
Sorting Algorithms, Data Structures |
| Oct 16 |
Session-3, Kahoot, Notes_Exercise-3 |
Time Complexity, Searching Algorithms, Sorting Algorithms |
| Oct 9 |
Session-2, Kahoot |
Maximum Subarray Sum, O-Notation |
| Oct 2 |
Session-1 |
Sums, O-Notation |
| Sep 25 |
Session-0 |
Asymptotic Growth, Induction Proofs |