Read our cookies policy and privacy statement for more information.
×Atlanta, Georgia•
Proof methods, strategy, correctness of algorithms over discrete structures. Induction and recursion. Complexity and order of growth. Number theoretic principles and algorithms. Counting and computability. Credit not allowed for both CS 2051 and CS 2050.
Units: 3.0