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
29947R001Lecture10:00-11:50amMon, Wed52 of 60Sandra BatistaGFS116PDF (109243 KB)session dates
29953D001Lecture2:00-3:20pmMon, Wed
72 of 72
Michael ShindlerSLH100PDF (109243 KB)session dates
29929R001Discussion4:00-5:50pmFriday55 of 62Michael ShindlerSLH102session dates
29954R001Discussion2:00-3:50pmFriday69 of 70Michael ShindlerSLH102session dates
30027R001Quiz7:00-8:50pmWednesday124 of 130Michael ShindlerTBAsession dates
29949R001Lecture10:00-11:50amMon, Wed45 of 60Leana GolubchikSSL150session dates
29957R001Discussion12:00-1:50pmFriday45 of 60Leana GolubchikVPD105session dates
30232R001QuizTBATBA45 of 60Leana GolubchikOFFICEsession dates
Information accurate as of September 28, 2017 1:04 pm.