Algorithms: Correctness and Complexity

Undergraduate

presents fundamental theories and practices for the design of correct and efficient computing systems, including specification of computing systems and their components, correctness with respect to specifications; methods of verification; algorithmic problem solving strategies (such as divide and conquer, dynamic programming); tractability and intractability of computational problems.