Computer Science 170:
Discrete Methods in Computer Science (4.0 units)
Sets, functions, series. Big-O notation and algorithm analysis.Propositional and first-order logic. Counting and discrete probability. Graphs and basic graph algorithms. Basic number theory. Prerequisites: CSCI 103L and CSCI 109. Duplicates credit in former CSCI 271.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 30044R | 055 | Lecture | 12:30-1:50pm | MTuWTh | 22 of 35 | Aaron Cote | KAP140 |    | |
| 30045R | 055 | Discussion | 1:00-3:00pm | Friday | 22 of 35 | KAP140 | | ||
| 30046R | 055 | Quiz | TBA | TBA | 22 of 35 | OFFICE | |