Lecture 3 hours; 3 credits.
Prerequisite CS 361.
Laboratory work required.
Design of efficient algorithms
and the mathematical analysis of their performance.
Topics to be covered include: mathematical preliminaries,
sorting and order statistics, advanced data structures,
greedy algorithms, exploring graphs, parallel algorithms, randomized
algorithms, transformation of the domain, and NP-completeness. (offered fall)