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 |
|---|---|---|---|---|---|---|---|---|---|
| 30115R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 10 of 60 | Leana Golubchik | VPD116 |    | |
| 30373R | 001 | Discussion | 10:00-11:50am | Friday | 10 of 60 | THH212 | | ||
| 30343R | 001 | Quiz | TBA | TBA | 2 of 60 | OFFICE | | ||
| 30008R | 001 | Lecture | 11:00-12:20pm | Tue, Thu | 56 of 75 | Michael Shindler | SLH100 | | |
| 30010R | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 60 of 75 | Aaron Cote | ZHS252 | | |
| 30108R | 001 | Lecture | 12:30-1:50pm | Tue, Thu | 61 of 70 | Michael Shindler | MHP105 | | |
| 30116R | 001 | Discussion | 2:00-3:50pm | Friday | 65 of 72 | THH212 | | ||
| 30349R | 001 | Discussion | 12:00-1:50pm | Friday | 62 of 72 | THH212 | | ||
| 30377R | 001 | Discussion | 8:00-9:50am | Friday | 50 of 72 | THH212 | | ||
| 29976R | 001 | Quiz | 5:00-6:50pm | Thursday | 185 of 240 | TBA | |