CS 220 P - Discrete Math for CS | |
---|---|
Full title: | Discrete Mathematics for Computer Science |
CRN: | 20596 |
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) |
Crosslist group: | GR |
Instructor: | Juyen Janet Hung (Juyen.Hung@enmu.edu) |
Seating | ||||||||
---|---|---|---|---|---|---|---|---|
Current | Waitlist | Crosslist | ||||||
Max | Curr | Avail | Max | Curr | Avail | Max | Curr | Avail |
24 | 14 | 10 | 24 | 0 | 24 | 34 | 20 | 14 |
Grading | |
---|---|
Grade mode: | Normal (A,B,C,D,F,I,W) |
Course dates | |
---|---|
Starts: | January 18, 2016 |
End: | May 13, 2016 |
Weeks: | 16 |
Census date: | February 5, 2016 |
Registration dates: | November 1, 2015 - January 25, 2016 |
Last day to drop: | January 25, 2016 |
Last day to withdraw: | June 10, 2016 |
Meeting dates and times | ||||||||
---|---|---|---|---|---|---|---|---|
Days | Time | Location | ||||||
M | W | F | 01:00pm - 01:50pm | University Computer Center 108 |
Crosslisted courses | |||
---|---|---|---|
Crosslist group | CRN | Course | Title |
GR | 22081 | CS 220 P | Discrete Math for CS |
Course Pre-requisites | |||||
---|---|---|---|---|---|
( | Test | Test score | Course | ) | Connector |
( | MATH 119 P | ) |