Course Detail
Units:
--
Course Components:
Discussion
Lecture
Enrollment Information
Enrollment Requirement:
Prerequisite: CP SC 2100 and CP SC 3500.
Requirement Designation:
Quantitative Intensive BS
Description
Study of algorithms, data structures, and complexity analysis beyond the introductory treatment from CP SC 2020. Balanced trees, heaps, hast 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 completemess. Laboratory practice.