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. Prerequisites: CSCI 103L and CSCI 109. Duplicates credit in former CSCI 271.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
29947R001Lecture9:30-10:50amTue, Thu57 of 60Michael ShindlerVKC156PDF (73537 KB)feesession dates
29949R001Lecture10:00-11:50amMon, Wed54 of 65Michael ShindlerVPD105PDF (73537 KB)feesession dates
29953R001Lecture2:00-3:20pmMon, Wed74 of 75Michael ShindlerSOSB46PDF (73537 KB)feesession dates
29929R001Discussion4:00-5:50pmFriday54 of 67SLH102session dates
29954R001Discussion2:00-3:50pmFriday62 of 65ZHS352session dates
29957R001Discussion12:00-1:50pmFriday69 of 70ZHS252session dates
30027R001Quiz5:00-6:50pmThursday185 of 200TBAsession dates
Information accurate as of March 7, 2016 8:09 am.