| CS 220 P - Discrete Math for CS | |
|---|---|
| Full title: | Discrete Mathematics for Computer Science |
| CRN: | 20729 |
| 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 |
| 24 | 22 | 2 | 24 | 0 | 24 |
| 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 | ||||||
| M | W | F | 01:00pm - 01:50pm | University Computer Center 107 | ||||
| Course Pre-requisites | |||||
|---|---|---|---|---|---|
| ( | Test | Test score | Course | ) | Connector |
| ( | MATH 119 P | ) | |||