CS 403
Spring 2022 All Classes
All Classes
Accelerated Fundamentals of Algorithms II
Credit: 3 hours.
The second class in a sequence of two classes that introduces students to the theoretical foundations of computer science. Topics include major paradigms of algorithm design divide and conquer, greedy, recursive, and dynamic programming; solving recurrences and analysis of divide and conquer algorithms; graph algorithms; formal models of computations like finite state automata and Turing machines; reductions.
No undergraduate credit. 3 graduate hours. Prerequisite: CS 401 or consent of instructor. Current enrollment in the Illinois Computing Accelerator for Non-specialists (iCAN) program or consent of instructor. Restricted to post-baccalaureate students with a non-computing background.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
73187
|
Online
|
AF3
|
2:00PM
-3:15PM
|
TR
|
n.a.
|
Gertner, Y
|
|