CSE 830: Design & Theory of Algorithms
Below are the documents and links needed for Fall 2020.
Syllabus - provides basic information about the course including how you will be graded.
Slack Discussion Board a place for asynchronous discussions and Q&A sessions.
Zoom will be used for all class sessions. The Zoom link has been e-mailed to all students and can be found pinned to the #general channel in the course Slack.
Below are the week-by-week topics that will be covered. Links will be added at least 24 hours before the first class each week (and often sooner). The current week will be in bold in the directory on the left of this page.
Graphing Code Results (11:30)
Optional: “Live” Coding: Other Sorting Algorithms (53:08)
Self-Balancing Binary Search Trees (11:11), by Dr. Emily Dolson
Order of Magnitude Problems (13:18)
Random Number Generators (12:43)
Other Bit Tricks (9:19)
Other C++ Optimizations (23:57)
Brute-Force Knapsack Algorithm (14:16)
Note: No class session on 11/26 (Thanksgiving)
P, NP, and NP-Complete Problems (14:41)
Week of 12/7
Pre-class videos: Advanced NP-Completeness Proofs; Cook’s Theorem
In class: HW 6 Review; Example Problems
Week of 12/14
Pre-class videos: An overview of Design Techniques; Algorithms for Alternative Models of Computation; Other topics?
In class: Discussion about algorithms, course, and future changes.