605.421 Foundations of Algorithms
This follow-on course to data structures (e.g., 605.202) provides a survey of computer algorithms, examines fundamental techniques in algorithm design and analysis, and develops problem-solving skills required in all programs of study involving computer science. Topics include advanced data structures (red-black and 2-3-4 trees, union-find), recursion and mathematical induction, algorithm analysis and computational complexity (recurrence relations, big-O notation, NP-completeness), sorting and searching, design paradigms (divide and conquer, greedy heuristic, dynamic programming, amortized analysis), and graph algorithms (depth-first and breadth-first search, connectivity, minimum spanning trees, network flow). Advanced topics are selected from among the following: randomized algorithms, information retrieval, string and pattern matching, and computational geometry.
Prerequisites: 605.202 Data Structures or equivalent.
Fall 2008 Course Schedule
The current scheduled offerings for this course for the Fall 2008 term
are listed below.
Computer Science
|
605.421.31 |
Foundations of Algorithms
(Open)
|
|
|
09/03/2008 - 12/10/2008
|
Room: L-3 |
$2,600 |
Sadowsky, J.
|
|
605.421.91 |
Foundations of Algorithms
(Open)
|
|
|
09/03/2008 - 12/10/2008
|
Room: D210 |
$2,600 |
Chlan, E.
|
|
605.421.71 |
Foundations of Algorithms
(Open)
|
|
|
09/07/2008 - 12/08/2008
|
Room: A&R211 |
$2,600 |
Boon, J.
|
|
605.421.72 |
Foundations of Algorithms
(Open)
|
|
|
09/06/2008 - 12/13/2008
|
Room: GH203 |
$2,600 |
Lew, W.
|
Online
|
605.421.81 |
Foundations of Algorithms
(Open)
|
|
|
09/03/2008 - 12/13/2008
|
|
$2,600 |
Sheppard, J.
|
