CSE 211|Summer 2026|IUB
Algorithms
3 Credits
Active Course
undergraduate
Quick Access
Consultation Hours
Office:BC5010-D
Hours:By appointment during Summer 2026 until the class routine is finalized.
Contact:(+88) 01676076329
Please make an appointment before visiting.Summer 2026 course page is now activeNew
Posted on 5/13/2026
Class routine, lab sections, and exam dates will be updated after official publication
Posted on 5/13/2026
Level
undergraduate
Credits
3 Credits
Semester
Summer 2026
Status
ongoing
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.
- Analyze the asymptotic performance of algorithms.
- Demonstrate a familiarity with major algorithms and data structures.
- Apply important algorithmic design paradigms and methods of analysis.
- Synthesize efficient algorithms in common engineering design situations.
- Understand NP-completeness and intractability.
Midterm Examination
Date
TBA
Seat Plan
Not published yet
Syllabus
Weeks 1-6
Final Examination
Date
TBA
Seat Plan
Not published yet
| Week | Module / Topic |
|---|---|
Week 1 Theory:Algorithm Analysis, Correctness, Insertion Sort Lab:Lab 0: Review & Intro to Google Colaboratory | Introduction to Algorithms |
Week 2 Theory:Big-O, Omega, Theta, Growth of Functions Lab:Lab 1: Asymptotic Analysis [Iterative & Recursive] | Asymptotic Notation |
Week 3 Theory:Substitution Method, Recursion Trees, Master Theorem Lab:Lab 2: Divide & Conquer | Recurrences |
Week 4 Theory:Merge Sort, Quick Sort, Analysis Lab:Project Discussion | Divide & Conquer |
Week 5 Theory:Binary Heaps, Heapsort, Priority Queue Operations Lab:Heap Implementation | Heaps & Priority Queues |
Week 6 Theory:Graph Representation, BFS, DFS Lab:Graph Traversal Implementation | Graph Basics |
Week 7 Theory:Review of Weeks 1-6 Lab:Mock Midterm Contest | Midterm Review |
Week 8 Theory:Dijkstra, Bellman-Ford Lab:SSSP Implementation | Shortest Paths |
Week 9 Theory:Prim, Kruskal Lab:MST Implementation | Minimum Spanning Trees |
Week 10 Theory:DP Basics, Rod Cutting, Memoization Lab:Basic DP Problems | Dynamic Programming I |
Week 11 Theory:LCS, Knapsack, Matrix Chain Multiplication Lab:Advanced DP Problems | Dynamic Programming II |
Week 12 Theory:Activity Selection, Huffman, P vs NP Lab:Greedy Problems & Final Contest | Greedy Algorithms & Complexity |
Summer 2026 Assignment 1
upcoming
Specification 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.
- Red Blob Games (Graphs)The world's best interactive guide to A*, BFS, and pathfinding.
- USFCA VisualizationsClassic, no-nonsense animations for sorting, trees, and graphs.
- Big-O Cheat SheetThe definitive reference poster for time and space complexity.
Practice Arena (Build It)
- VJudge ContestThe official Summer 2026 class programming contest.
- CSES Problem SetStandard collection of classic competitive programming problems.
- LeetCode: AlgorithmsStructured study plan for interview preparation.
- AtCoderNewHigh-quality algorithmic contests from Japan. Great for practice.
- Codeforces EDUNewFree courses on Segment Trees, DP, and more (ITMO Academy).
Reference & Deep Dives
Recommended Reading
Video Archive
1 Videos
Previous Year Lectures
Watch