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.
- Prerequisite: CSCI 102
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29960R | 051 | Lecture | 1:00-3:05pm | MWF | 13 of 70 | Shaddin Dughmi | GFS116 |  | |
| 29961R | 051 | Discussion | 1:00-3:05pm | Thursday | 13 of 70 | GFS116 | | ||
| 29962R | 051 | Quiz | TBA | TBA | 13 of 70 | OFFICE | |