Algorithms
Active Course 3 Credits Undergraduate
Week
01
This week · Unit I · Foundations
Introduction to Algorithms
TheoryAlgorithm analysis, correctness, insertion sort
LabLab 0 — Review & intro to Google Colab
Join the lab contest VJudge · live now
Notice board 4
Updated 13 May 2026
newSummer 2026 course page is now active.Posted 13 May 2026
updateClass routine, lab sections, and exam dates will be updated after official publication.Posted 13 May 2026
Duration
12 weeks
Units
4
Structure
Theory + Lab
Sections
5
Comprehensive study of algorithm analysis and design. Topics include sorting, searching, graph algorithms, dynamic programming, and complexity analysis (Big O). Emphasis on solving complex computational problems efficiently.
Learning outcomes
- 01Analyze the asymptotic performance of algorithms.
- 02Demonstrate a familiarity with major algorithms and data structures.
- 03Apply important algorithmic design paradigms and methods of analysis.
- 04Synthesize efficient algorithms in common engineering design situations.
- 05Understand NP-completeness and intractability.
PythonC++Jupyter Notebook
You coordinate this course — every section across instructors is listed here.
| Sec | Instructor | Days | Time | Room | Type |
|---|---|---|---|---|---|
| 01 | Md Asif Bin Khaled | Sun · Tue | 09:40–11:10 | BC 2008 | Theory |
| 02 | Instructor B — TBA | Sun · Tue | 11:20–12:50 | Room — TBA | Theory |
| 03 | Instructor C — TBA | Mon · Wed | 09:40–11:10 | Room — TBA | Theory |
| L1 | Md Asif Bin Khaled | Thu | 11:20–14:20 | BC 5012 (CL) | Lab |
| L2 | Instructor B — TBA | Thu | 14:30–17:30 | Lab — TBA | Lab |
Placeholder roster — replace with the registrar's published routine once confirmed.
WkTopicTheoryLab
Unit I · Foundations
Algorithm analysis, correctness, insertion sortLab 0 — Review & intro to Google Colab
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Big-O, Ω, Θ, growth of functionsLab 1 — Asymptotic analysis
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Substitution method, recursion trees, Master theoremLab 2 — Divide & conquer
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Unit II · Divide & Conquer · Data Structures
Merge sort, quicksort, analysisProject discussion
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Binary heaps, heapsort, priority-queue operationsHeap implementation
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Unit III · Graph Algorithms
Representation, BFS, DFSGraph traversal implementation
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Review of Weeks 1–6Mock midterm contest
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Dijkstra, Bellman-FordSSSP implementation
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Prim, KruskalMST implementation
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Unit IV · Dynamic Programming · Complexity
DP basics, rod cutting, memoizationBasic DP problems
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
LCS, knapsack, matrix-chain multiplicationAdvanced DP problems
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
Activity selection, Huffman, P vs NPGreedy problems & final contest
Materials Slides Lab notebook Practice setLinks publish as the term progresses.
CSE 211 · Theory3 credits
Attendance5%
Assignments10%
Lab & contest25%
Midterm25%
Final35%
Total100%
CSE 211L · Lab1 creditDraft
Lab tasks35%
Lab attendance10%
Contest20%
Lab midterm15%
Lab final20%
Total100%
Summer 2026 Assignment 1Specification will be published after the Summer 2026 class routine and lab sections are finalized.Coming soon
Interactive Labs (Visualize It)
VisuAlgoNewStep-by-step algorithm animations used by top universities worldwide.Open Red Blob Games (Graphs)The world's best interactive guide to A*, BFS, and pathfinding.Open USFCA VisualizationsClassic, no-nonsense animations for sorting, trees, and graphs.Open Big-O Cheat SheetThe definitive reference poster for time and space complexity.Open Practice Arena (Build It)
VJudge ContestThe official Summer 2026 class programming contest.Open CSES Problem SetStandard collection of classic competitive programming problems.Open LeetCode: AlgorithmsStructured study plan for interview preparation.Open AtCoderNewHigh-quality algorithmic contests from Japan. Great for practice.Open Codeforces EDUNewFree courses on Segment Trees, DP, and more (ITMO Academy).Open Reference & Deep Dives
CP-AlgorithmsNewComprehensive encyclopedia of algorithms with code and explanations.Open Recommended Reading
MIT 6.006 Video LecturesNewWorld-renowned algorithm lectures from MIT (free, full course).Open