|Click the Schedule Type to find available offerings of the course on the Schedule of Classes.
|CS 2050 - Intro Discrete Math CS
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 2050 and CS 2051.
3.000 Credit hours
3.000 Lecture hours
Grade Basis: ALP
All Sections for this Course
Dept/Computer Science Department
May not be enrolled in one of the following Levels:
Must be enrolled in one of the following Campuses:
Georgia Tech-Atlanta *
|Return to Previous