Theory of Algorithms

3 credits · Undergraduate credit

Many common problems from mathematics and computer science may be solved by applying one or more algorithms, well-defined procedures that accept input data specifying a particular instance of the problem and produce a solution. Students in this course typically have encountered some of these problems and their algorithmic solutions in a programming course. The goal here is to develop the mathematical tools necessary to analyze such algorithms with respect to their efficiency (running time) and correctness. Each term offers varying degrees of emphasis on mathematical proofs and computer implementation of these ideas.