CSE 5311 - Design and Analysis of Algorithms
⭓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
⭓Schedule
This schedule is tentative and may change.
| Date | Topic | Materials |
|---|---|---|
| October 13 | Course Introduction, Algorithms, Growth of Functions, Computational Complexity | |
| October 15 | Divide and Conquer Algorithms | |
| October 20 | Master Theorem, Heapsort, and Quicksort | |
| October 22 | Linear-Time Sorting Algorithms and Medians | |
| October 27 | Hash Maps, Binary Search Trees | |
| October 29 | Red-Black Trees, AVL Trees, and Dynamic Programming |