CS 275 - Mathematical Foundations of Algorithms

(4 S.H.)

The formal study of the mathematical foundations of algorithms. This course provides students with an algorithm-based introduction to discrete mathematical structures and their application to computer science. Topics include sets, relations, graphs, proof techniques, induction, recursive definitions, and recurrence relations. Applications include the correctness and complexity of algorithms. (Students may receive credit for either CS 275 or MATH 247, not both.) Prerequisites: CS 234 - Algorithms and Problem-Solving I and MATH 120 - Precalculus or higher, or instructor permission. (Students must receive a C grade or better in the qualifying prerequisite courses to remain enrolled in CS 275.) Grade only. Offered each semester.

Course Registration