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 |
|---|---|---|---|---|---|---|---|---|---|
| 29947R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 52 of 60 | Sandra Batista | GFS116 | PDF (109243 KB) |  |
| 29953D | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 72 of 72 | Michael Shindler | SLH100 | PDF (109243 KB) | |
| 29929R | 001 | Discussion | 4:00-5:50pm | Friday | 55 of 62 | Michael Shindler | SLH102 | | |
| 29954R | 001 | Discussion | 2:00-3:50pm | Friday | 69 of 70 | Michael Shindler | SLH102 | | |
| 30027R | 001 | Quiz | 7:00-8:50pm | Wednesday | 124 of 130 | Michael Shindler | TBA | | |
| 29949R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 45 of 60 | Leana Golubchik | SSL150 | | |
| 29957R | 001 | Discussion | 12:00-1:50pm | Friday | 45 of 60 | Leana Golubchik | VPD105 | | |
| 30232R | 001 | Quiz | TBA | TBA | 45 of 60 | Leana Golubchik | OFFICE | |