| CS 220 P - Discrete Math for CS | |
|---|---|
| Full title: | Discrete Mathematics for Computer Science |
| CRN: | 11474 |
| Course description: | Theory and applications of discrete mathematical models fundamental to analysis of problems in computer science. Topics include set theory, methods of proofs, relations and functions, combinatorics and probability, graphs and trees, and Boolean algebra. Prerequisite: MATH 1220. (F) |
| Instructor: | Brian Pasko (Brian.Pasko@enmu.edu) |
| Seating | |||||
|---|---|---|---|---|---|
| Current | Waitlist | ||||
| Max | Curr | Avail | Max | Curr | Avail |
| 40 | 24 | 16 | 10 | 0 | 10 |
| Grading | |
|---|---|
| Grade mode: | Normal (A,B,C,D,F,I,W) |
| Course dates | |
|---|---|
| Starts: | August 18, 2020 |
| End: | December 11, 2020 |
| Weeks: | 16 |
| Census date: | September 4, 2020 |
| Registration dates: | March 29, 2020 - August 25, 2020 |
| Last day to drop: | August 25, 2020 |
| Last day to withdraw: | November 6, 2020 |
| Meeting dates and times | ||||||||
|---|---|---|---|---|---|---|---|---|
| Days | Time | Location | ||||||
| M | W | F | 12:00pm - 12:50pm | Web | ||||
| Course Pre-requisites | |||||
|---|---|---|---|---|---|
| ( | Test | Test score | Course | ) | Connector |
| ( | MATH 119 P | ) | |||