About MATH 2678 A
Introduction to basic combinatorial principles emphasizing problem-solving techniques. Enumeration, generating functions, Fibonacci numbers, pigeonhole principle, inclusion-exclusion, and graph theory. Prerequisites: MATH 2055 (preferred) or CS 1640.
Notes
Prereqs enforced by the system: MATH 2055 (preferred) or CS 1640; Open to Degree and PACE students
Section Description
The focus of this course is to learn different classic enumeration techniques, problem-solving methods, and graph theory.
Section Expectation
Students will be expected to attend class, and the focus will be on working through problems and examples both during and outside of class.
Evaluation
Grades will be based on participation, assignments, and quizzes.
Important Dates
Note: These dates may change before registration begins.
Note: These dates may not be accurate for select courses during the Summer Session.
| Last Day to Add | |
|---|---|
| Last Day to Drop | |
| Last Day to Withdraw with 50% Refund | |
| Last Day to Withdraw with 25% Refund | |
| Last Day to Withdraw |
Resources
There are no courses that meet this criteria.
Interest Form
MATH 2678 A is closed to new enrollment.
But we can remind you a few days before the next term opens. You can also see what terms are enrolling currently.