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.
- Prerequisite: CSCI 102
- Note: Prerequsite Waiver Request Form tinyurl.com/103170prereq
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 30136D | 001 | Lecture | 9:30-10:50am | Tue, Thu | 109 of 115 | Victor Adamchik | MHP101 |   | |
| 30137R | 001 | Lecture | 11:00-12:20pm | Tue, Thu | 213 of 240 | Victor Adamchik | SAL101 | | |
| 29929R | 001 | Discussion | 4:00-5:50pm | Friday | 57 of 60 | GFS118 | | ||
| 29954R | 001 | Discussion | 2:00-3:50pm | Friday | 55 of 60 | THH212 | | ||
| 29980R | 001 | Discussion | 10:00-11:50am | Friday | 53 of 60 | THH102 | | ||
| 30106R | 001 | Discussion | 12:00-1:50pm | Friday | 55 of 60 | GFS116 | | ||
| 30299R | 001 | Discussion | 12:00-1:50pm | Friday | 43 of 60 | ZHS352 | | ||
| 30300R | 001 | Discussion | 2:00-3:50pm | Friday | 59 of 60 | LVL17 | | ||
| 30027R | 001 | Quiz | 7:00-8:50pm | Wednesday | 322 of 360 | TBA | |