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 |
|---|---|---|---|---|---|---|---|---|---|
| 29947R | 001 | Lecture | 5:00-6:20pm | Mon, Wed | 28 of 53 | Ming-Deh Huang | ZHS352 |   | |
| 29949D | 001 | Lecture | 10:00-11:50am | Mon, Wed | 55 of 57 | Aaron Cote | MHP106 | | |
| 29953R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 50 of 53 | Aaron Cote | SOSB46 | | |
| 30200R | 001 | Lecture | 11:00-12:20pm | Tue, Thu | Canceled | | |||
| 29948R | 001 | Discussion | 5:00-5:50pm | Wednesday | 32 of 45 | GFS116 | | ||
| 29954R | 001 | Discussion | 10:00-10:50am | Friday | 40 of 46 | SLH102 | | ||
| 29957R | 001 | Discussion | 3:30-4:20pm | Thursday | 42 of 45 | GFS116 | | ||
| 30198R | 001 | Discussion | 4:30-5:20pm | Thursday | 19 of 45 | GFS116 | | ||
| 30027R | 001 | Quiz | 5:00-6:50pm | Friday | 133 of 250 | TBA | |