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
30115R001Lecture10:00-11:50amMon, Wed10 of 60Leana GolubchikVPD116notefeesession dates
30373R001Discussion10:00-11:50amFriday10 of 60THH212session dates
30343R001QuizTBATBA2 of 60OFFICEsession dates
30008R001Lecture11:00-12:20pmTue, Thu56 of 75Michael ShindlerSLH100feesession dates
30010R001Lecture2:00-3:20pmTue, Thu60 of 75Aaron CoteZHS252feesession dates
30108R001Lecture12:30-1:50pmTue, Thu61 of 70Michael ShindlerMHP105feesession dates
30116R001Discussion2:00-3:50pmFriday65 of 72THH212session dates
30349R001Discussion12:00-1:50pmFriday62 of 72THH212session dates
30377R001Discussion8:00-9:50amFriday50 of 72THH212session dates
29976R001Quiz5:00-6:50pmThursday185 of 240TBAsession dates
Information accurate as of October 4, 2015 4:49 pm.