MATH 420 P - Combinatorial Analysis | |
---|---|
Full title: | Combinatorial Analysis |
CRN: | 21228 |
Course description: | Enumeration techniques; permutations, combinations, occupancy problems, generating functions, inclusion and exclusion, recurrence relations, Polya's theory of counting. Prerequisite: CS 220 or MATH 340 or consent of instructor. (Even S) |
Instructor: | Brian Pasko (Brian.Pasko@enmu.edu) |
Seating | |||||
---|---|---|---|---|---|
Current | Waitlist | ||||
Max | Curr | Avail | Max | Curr | Avail |
20 | 6 | 14 | 20 | 0 | 20 |
Grading | |
---|---|
Grade mode: | Normal (A,B,C,D,F,I,W) |
Course dates | |
---|---|
Starts: | January 13, 2014 |
End: | May 9, 2014 |
Weeks: | 16 |
Census date: | January 31, 2014 |
Registration dates: | November 10, 2013 - January 20, 2014 |
Last day to drop: | January 20, 2014 |
Last day to withdraw: | April 11, 2014 |
Meeting dates and times | ||||||||
---|---|---|---|---|---|---|---|---|
Days | Time | Location | ||||||
T | R | 02:00pm - 03:15pm | College of Business 117 |
Course Pre-requisites | |||||
---|---|---|---|---|---|
( | Test | Test score | Course | ) | Connector |
( | CS 220 P | ) | or | ||
( | MATH 340 P | ) |