CSI 3610: Design and Analysis of Algorithms

Dr. Tianle Ma  ·  Winter 2026

📖

Click any lecture card to access slides and handouts. Use Slides for the interactive presentation or Handout for a printable version.

Lecture Materials

Lecture 01

Course Introduction & Fundamentals

📽️ Slides 📄 Handout
Lecture 02

Asymptotic Notation

📽️ Slides 📄 Handout
Lecture 03

Correctness & Loop Invariants

📽️ Slides 📄 Handout
Lecture 04

Divide & Conquer and Recurrences

📽️ Slides 📄 Handout
Lecture 05

Quicksort, Randomization, and Lower Bounds

📽️ Slides 📄 Handout
Lecture 06

Heaps, Heapsort, and Priority Queues

📽️ Slides 📄 Handout
Lecture 07

Greedy Algorithms

📽️ Slides 📄 Handout
Lecture 08

Huffman Coding

📽️ Slides 📄 Handout
Lecture 09

Graphs, BFS, and DFS

📽️ Slides 📄 Handout
Lecture 10

Topological Sort & Midterm Review

📽️ Slides 📄 Handout
Lecture 11

Minimum Spanning Trees

📽️ Slides 📄 Handout
Lecture 12

Shortest Paths (Dijkstra)

📽️ Slides 📄 Handout
Lecture 13

Shortest Paths: Bellman-Ford & Floyd-Warshall

📽️ Slides 📄 Handout
Lecture 14

Introduction to Dynamic Programming

📽️ Slides 📄 Handout
Lecture 15

Dynamic Programming: Classic Problems & Patterns

📽️ Slides 📄 Handout
Lecture 16

Introduction to Complexity Theory

📽️ Slides 📄 Handout
Lecture 17

NP-Completeness & Reductions

📽️ Slides 📄 Handout
Lecture 18

Advanced NP-Completeness & Reductions

📽️ Slides 📄 Handout
Lecture 19

Course Review

📽️ Slides 📄 Handout

Course Resources

📊

Algorithm Visualizations

Interactive visualizations for 33+ algorithms including sorting, graphs, dynamic programming, and more.

Open Visualizations →