CISC 7200X

About this course

37� hours plus conference and independent work; 3 creditsIntroduction 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. Not open to students who have completed an undergraduate course in analysis of algorithms.Prerequisite: A course in data structures; and a course in discrete structures.