CS 452. Design and Analysis of Algorithms

3.00
Crosslisted: MATH 452

An introduction to the analysis, design and theory of algorithms. Algorithms studied will be selected from searching, sorting and graph theory. Included are elements of counting, recurrence relations, direct and indirect proofs, recursion, complexity classes, language theory, decidability and undecidability. Prerequisites: CS 240 and CS 327