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
- Note: Prerequsite Waiver Request Form tinyurl.com/103170prereq
Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
---|---|---|---|---|---|---|---|---|---|
30108D | 001 | Lecture | 9:30-10:50am | Tue, Thu | 121 of 131 | Sandra Batista,Victor Adamchik | SGM124 & ONLINE | ||
30111D | 001 | Lecture | 11:00-12:20pm | Tue, Thu | 108 of 130 | Sandra Batista,Victor Adamchik | THH201 & ONLINE | ||
30295D | 001 | Lecture | 12:30-1:50pm | Tue, Thu | 47 of 50 | Sandra Batista,Victor Adamchik | THH201 & ONLINE | ||
30116R | 001 | Discussion | 2:00-3:50pm | Friday | 95 of 105 | SGM123 & ONLINE | |||
30373R | 001 | Discussion | 10:00-11:50am | Friday | 91 of 105 | SGM124 & ONLINE | |||
30377R | 001 | Discussion | 12:00-1:50pm | Friday | 90 of 105 | SGM123 & ONLINE | |||
30343R | 001 | Quiz | TBA | Friday | 276 of 310 | OFFICE & ONLINE |