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.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
29947D001Lecture5:00-6:20pmMon, Wed142 of 151Shahriar ShamsianSGM101session dates
30121D001Lecture6:30-7:50pmMon, Wed117 of 127Shahriar ShamsianSGM101session dates
29929R001Discussion4:00-5:50pmFriday24 of 50GFS118session dates
29954R001Discussion2:00-3:50pmFriday49 of 50THH114session dates
29980R001Discussion10:00-11:50amFriday46 of 50THH210session dates
30106R001Discussion12:00-1:50pmFriday48 of 50THH114session dates
30299R001Discussion12:00-1:50pmFriday46 of 50THH116session dates
30300R001Discussion2:00-3:50pmFriday46 of 50THH210session dates
30027R001Quiz7:00-8:50pmTuesday259 of 278TBAsession dates
Information accurate as of January 19, 2024 5:02 pm.