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.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29947D | 001 | Lecture | 10:00-11:50am | Mon, Wed | 66 of 68 | Aaron Cote | VPD105 |   | |
| 29953D | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 72 of 76 | Aaron Cote | ZHS252 | | |
| 30273R | 001 | Lecture | 12:00-1:50pm | Mon, Wed | 67 of 80 | Sandra Batista | SLH102 | | |
| 29929R | 001 | Discussion | 4:00-5:50pm | Friday | 66 of 75 | GFS116 | | ||
| 29954R | 001 | Discussion | 2:00-3:50pm | Friday | 71 of 74 | GFS116 | | ||
| 30106R | 001 | Discussion | 12:00-1:50pm | Friday | 68 of 75 | LVL17 | | ||
| 30027R | 001 | Quiz | 7:00-8:50pm | Wednesday | 205 of 225 | TBA | |