CSE 5311 - Design and Analysis of Algorithms

Fall 2025

Last updated on Oct 12, 2025

⭓Description

This is the course page for CSE 5311 - Design and Analysis of Algorithms in Fall 2025. Here you’ll find class notes and other helpful resources. All assignments and announcements will be posted on Canvas.

Instructor Office Hours

Days	Time	Location
MoWeFri	10AM - 11AM	ERB 556A
TuTh	11AM - 12PM	ERB 556A

Teaching Assistant

Runbang Hu (rxh0841@mavs.uta.edu)

⭓Course Materials

Books

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, 3rd Edition, The MIT Press, 2009.

Resources

Python Programming Language

⭓Schedule

This schedule is tentative and may change.

Date	Topic	Materials
October 13	Course Introduction, Algorithms, Growth of Functions, Computational Complexity	Introduction to Algorithms Complexity Analysis
October 15	Divide and Conquer Algorithms	Divide and Conquer Master Theorem
October 20	Master Theorem, Heapsort, and Quicksort	Master Theorem Heapsort Quicksort
October 22	Linear-Time Sorting Algorithms and Medians	Sorting in Linear Time Medians and Order Statistics
October 27	Hash Maps, Binary Search Trees	Binary Search Trees Red-Black Trees
October 29	Red-Black Trees (Delete) and Hash Maps	Red-Black Trees Hash Maps
November 3	Exam 1
November 5	Hash Maps and Dynamic Programming	Hash Maps Dynamic Programming
November 10	Dynamic Programming Examples and Greedy Algorithms	Dynamic Programming Greedy Algorithms
November 12	Graph Algorithms and Topological Sort	Introduction to Graph Theory Topological Sort
November 17	Minimum Spanning Trees, Single-Source Shortest Paths	Minimum Spanning Trees Single-Source Shortest Paths
November 19	All-Pairs Shortest Paths, Maximum Flow	All-Pairs Shortest Paths Maximum Flow