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 |
|---|---|---|---|---|---|---|---|---|---|
| 30136R | 001 | Lecture | 9:30-10:50am | Tue, Thu | 56 of 60 | Sandra Batista | THH210 |  | |
| 30137D | 001 | Lecture | 11:00-12:20pm | Tue, Thu | 59 of 62 | Sandra Batista | THH116 | | |
| 30138R | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 55 of 61 | Sandra Batista | VPD105 | | |
| 30139R | 001 | Lecture | 3:30-4:50pm | Tue, Thu | 48 of 70 | Sandra Batista | SOSB46 | | |
| 29929R | 001 | Discussion | 4:00-5:50pm | Friday | 70 of 80 | GFS116 | | ||
| 29954R | 001 | Discussion | 2:00-3:50pm | Friday | 74 of 75 | SOSB46 | | ||
| 30106R | 001 | Discussion | 12:00-1:50pm | Friday | 74 of 80 | GFS116 | | ||
| 30027R | 001 | Quiz | 7:00-8:50pm | Wednesday | 218 of 250 | TBA | |