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
30136D001Lecture9:30-10:50amTue, Thu146 of 200Victor AdamchikSGM124notesession dates
30137D001Lecture11:00-12:20pmTue, Thu150 of 200Victor AdamchikSAL101notesession dates
30139R001Lecture8:00-9:20amTue, Thu
Canceled
notesession dates
29929R001Discussion4:00-5:50pmFriday17 of 125THH102session dates
29954R001Discussion2:00-3:50pmFriday72 of 125THH301session dates
29980R001Discussion10:00-11:50amFriday79 of 125THH102session dates
30106R001Discussion12:00-1:50pmFriday69 of 125THH301session dates
30299R001Discussion12:00-1:50pmFriday30 of 70LVL17session dates
30300R001Discussion2:00-3:50pmFriday29 of 70LVL17session dates
30027R001Quiz7:00-8:50pmWednesday296 of 500TBAsession dates
Information accurate as of February 7, 2022 7:48 am.