CISC 7200X Analysis of Algorithms
37½ hours plus conference and independent work; 3 credits
Introduction to algorithms and their complexity, including models of computation. Review of data structures and techniques of efficient program design. Analysis of algorithms chosen from sorting and searching, graph theory, pattern matching, matrix operations, and combinatorial optimization. Algorithms will be analyzed for their space, time, and other resource requirements. NP-complete problems. Complexity classes.
Prerequisite: A course in data structures; and a course in discrete structures.
The City University reserves the right, because of changing conditions,
to make modifications of any nature in academic programs and requirements
of the university and its constituent colleges without advanced notice.
Students are advised to consult regularly with college and department counselors
concerning their programs of study.
Access the college's current and recent course bulletins.