MATH 2678 A (CRN: 12957)
Mathematics: Basic Combinatorial Theory
3 Credit Hours—Seats Available!
Registration
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
Syllabus Unavailable
Please contact the instructor for information about this course.
Important Dates
Note: These dates may not be accurate for select courses during the Summer Session.
Courses may be cancelled due to low enrollment. Show your interest by enrolling.
| 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.