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
30136R001Lecture9:30-10:50amTue, Thu56 of 60Sandra BatistaTHH210session dates
30137D001Lecture11:00-12:20pmTue, Thu59 of 62Sandra BatistaTHH116session dates
30138R001Lecture2:00-3:20pmTue, Thu55 of 61Sandra BatistaVPD105session dates
30139R001Lecture3:30-4:50pmTue, Thu48 of 70Sandra BatistaSOSB46session dates
29929R001Discussion4:00-5:50pmFriday70 of 80GFS116session dates
29954R001Discussion2:00-3:50pmFriday74 of 75SOSB46session dates
30106R001Discussion12:00-1:50pmFriday74 of 80GFS116session dates
30027R001Quiz7:00-8:50pmWednesday218 of 250TBAsession dates
Information accurate as of March 9, 2020 7:44 am.
All Summer 2020 courses will be taught remotely. Faculty will contact students to provide information to login to classes.