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 |
|---|---|---|---|---|---|---|---|---|---|
| 30121R | 001 | Lecture | 11:00-12:20pm | Tue, Thu | 54 of 60 | Michael Shindler | GFS116 | PDF (86717 KB) |   |
| 29947R | 001 | Lecture | 9:30-10:50am | Tue, Thu | 34 of 60 | Michael Shindler | SOSB46 | PDF (86717 KB) | |
| 29949R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 57 of 60 | Michael Shindler | SSL150 | PDF (86717 KB) | |
| 29929R | 001 | Discussion | 4:00-5:50pm | Friday | 26 of 65 | ZHS352 | | ||
| 29954R | 001 | Discussion | 2:00-3:50pm | Friday | 55 of 65 | ZHS352 | | ||
| 29957R | 001 | Discussion | 12:00-1:50pm | Friday | 63 of 65 | ZHS252 | | ||
| 30027R | 001 | Quiz | 7:00-8:50pm | Thursday | 144 of 200 | TBA | |