Go to Main Content

Georgia Tech

 

HELP | EXIT

Catalog Entries

 

Spring 2022
Jul 21, 2024
Transparent Image
Information The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes.
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

Course Attributes:
STEM USG


Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.7.2.4GT