Skip to main content
CSE 211|Spring 2026|IUB

Algorithms

3 Credits
Active Course
undergraduate

Quick Access

Course Outline (Theory)Course Outline (Lab)Lecture Slides (Drive)Python Cheat SheetDiscord CommunityAnonymous Feedback

Consultation Hours

Office:BC5010 - D
Hours:Mon & Wed, 2:40 PM - 4:10 PM
Contact:(+88) 01676076329
Please make an appointment before visiting.

Level

undergraduate

Credits

3 Credits

Semester

Spring 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.

Class Schedule

Spring 2026 Semester

Sec 01
Theory
Mr. Mohammad Motiur Rahman
ST • 08:00-09:30
BC6012
Lab
Md Junayed Hossain
S • 09:40-11:10
MK7005L
Sec 02
Theory
Md Asif Bin Khaled
ST • 09:40-11:10
MK5007
Lab
Md Junayed Hossain
S • 08:00-09:30
MK7005L
Sec 03
Theory
Md Asif Bin Khaled
ST • 11:20-12:50
MK5006
Lab
Md Junayed Hossain
S • 13:00-14:30
MK7005L
Sec 04
Theory
Mr. Mohammad Motiur Rahman
ST • 13:00-14:30
MK4008
Lab
Mohammad Arshad Hossain Ratul
S • 11:20-12:50
MK7005L
Sec 05
Theory
Mostafiz Ahammed
MW • 08:00-09:30
MK5010
Lab
Sumaia Anjum Shaba
M • 09:40-11:10
MK7005L
Sec 06
Theory
Mostafiz Ahammed
MW • 09:40-11:10
MK5005
Lab
Md Junayed Hossain
M • 08:00-09:30
MK7005L
Sec 08
Theory
Md Zahangir Alam
MW • 13:00-14:30
C6007
Lab
Md Junayed Hossain
M • 11:20-12:50
MK7005L

Midterm Examination

Date
TBA
Seat Plan
Not published yet
Syllabus
Weeks 1-6

Final Examination

Date
TBA
Seat Plan
Not published yet
WeekModule / 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

Assignment 1 Specification

active

Review the detailed requirement specification for Assignment 1.

View Assignment

Interactive Labs (Visualize It)

  • VisuAlgo
    New
    Step-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 Contest🏆 The official class programming contest.
  • CSES Problem SetStandard collection of classic competitive programming problems.
  • LeetCode: AlgorithmsStructured study plan for interview preparation.
  • AtCoder
    New
    High-quality algorithmic contests from Japan. Great for practice.
  • Codeforces EDU
    New
    Free courses on Segment Trees, DP, and more (ITMO Academy).

Reference & Deep Dives

  • CP-Algorithms
    New
    Comprehensive encyclopedia of algorithms with code and explanations.

Recommended Reading

  • MIT 6.006 Video Lectures
    New
    World-renowned algorithm lectures from MIT (free, full course).

Course Materials

  • Course Outline (Theory)Official syllabus and policy document.
  • Lecture SlidesGoogle Drive folder with all class slides.
  • Sample Case Studies & ProblemsPractice problems and case study materials.

Video Archive

1 Videos
Previous Year Lectures
Watch