Course Detail
Units:
3.0
Course Components:
Discussion
Lecture
Enrollment Information
Enrollment Requirement:
Recommended Prerequisite: CP SC 3500.
Requirement Designation:
Quantitative Intensive BS
Description
Study of algorithms, data structures, and complexity analysis beyond the introductory treatment in CP SC 2020. Balanced trees, heaps, hash tables, string matching, graph algorithms, external sorting and searching. Dynamic programming, exhaustive search. Space and time complexity, derivation and solution of recurrence relations, complexity hierarchies, reducibility, NP completeness.