| CS 220 P - Discrete Math for CS | |
|---|---|
| Full title: | Discrete Mathematics for Computer Science |
| CRN: | 20690 |
| 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 119 (S) |
| Instructor: | Juyen Janet Hung (Juyen.Hung@enmu.edu) |
| Seating | |||||
|---|---|---|---|---|---|
| Current | Waitlist | ||||
| Max | Curr | Avail | Max | Curr | Avail |
| 20 | 11 | 9 | 20 | 0 | 20 |
| Grading | |
|---|---|
| Grade mode: | Normal (A,B,C,D,F,I,W) |
| Course dates | |
|---|---|
| Starts: | January 19, 2015 |
| End: | May 15, 2015 |
| Weeks: | 16 |
| Census date: | February 6, 2015 |
| Registration dates: | November 2, 2014 - January 26, 2015 |
| Last day to drop: | January 26, 2015 |
| Last day to withdraw: | April 17, 2015 |
| Meeting dates and times | ||||||||
|---|---|---|---|---|---|---|---|---|
| Days | Time | Location | ||||||
| M | W | F | 01:00pm - 01:50pm | Education 130 | ||||
| Course Pre-requisites | |||||
|---|---|---|---|---|---|
| ( | Test | Test score | Course | ) | Connector |
| ( | MATH 119 P | ) | |||