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
30008R001Lecture10:00-11:50amMon, Wed90 of 91Aaron CoteSLH102feesession dates
30108R001Lecture2:00-3:20pmMon, Wed81 of 91Aaron CoteSLH100feesession dates
30115R001Lecture4:00-5:20pmMon, Wed69 of 75Michael ShindlerZHS352PDF (60115 KB)feesession dates
30116R001Discussion2:00-3:50pmFriday62 of 65GFS106session dates
30349R001Discussion4:00-5:50pmFriday58 of 65SLH102session dates
30373R001Discussion10:00-11:50amFriday61 of 65THH210session dates
30377R001Discussion12:00-1:50pmFriday59 of 65ZHS352session dates
30343R001QuizTBAThursday240 of 255OFFICEnotesession dates
Information accurate as of October 5, 2016 8:25 am.