Theory of Computation and Algorithms

Catalog description

This advanced course is intended for students pursuing a higher degree in Computer Science or a related field. Students will analyze programs that they and others have written to determine their efficiency, deepen their understanding of how to reason about programs, their behavior, their runtime, and learn principles for writing code to solve problems more effectively, independent of the languages or tools they are using. Topics covered include sorting and searching algorithms, graph theory, dynamic programming, and identifying NP-complete problems with a focus on complexity theory and big-O notation throughout. Prior familiarity with mathematical proof techniques such as induction and proof by contradiction is required. Pre-requisite(s): CISS 111 Programming and Logic II – Data Structures and MATH 183 Discrete Mathematics No