Elementary combinatorial techniques used in discrete problem solving: counting methods, solving linear recurrences, graph and network models, related algorithms, and combinatorial designs.
Requisites
Prerequisites:
MATH 1502 (Min. Grade: D) or MATH 1512 (Min. Grade: D) or MATH 1504 (Min. Grade: D) or MATH 1555 (Min. Grade: D) or ((MATH 1552 (Min. Grade: D) or MATH 15X2 (Min. Grade: T) or MATH 1X52 (Min. Grade: T)) and (MATH 1553 (Min. Grade: D) or MATH 1554 (Min. Grade: D) or MATH 1X54 (Min. Grade: T) or MATH 1564 (Min. Grade: D) or MATH 1522 (Min. Grade: D) or MATH 1X53 (Min. Grade: T)))
Restrictions:
Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * (A)
All Instructors
GPA: 3.17Most Common: A (45.5%)
This total includes data from semesters with unknown instructors