CPSCI-330 Algorithms

Discussion of the canon of standard algorithms, with analysis of time and space complexity. Topics will include, among others: sorting, searching and selection; numerical algorithms; string matching; graph algorithms; parallel algorithms; non-determinism and NP-completeness. Theory intensive.

Maximum Enrollment

24

Credits

1

Prerequisite

CPSCI-230