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
29947R001Lecture5:00-6:20pmMon, Wed28 of 53Ming-Deh HuangZHS352feesession dates
29949D001Lecture10:00-11:50amMon, Wed55 of 57Aaron CoteMHP106feesession dates
29953R001Lecture2:00-3:20pmMon, Wed50 of 53Aaron CoteSOSB46feesession dates
30200R001Lecture11:00-12:20pmTue, Thu
Canceled
feesession dates
29948R001Discussion5:00-5:50pmWednesday32 of 45GFS116session dates
29954R001Discussion10:00-10:50amFriday40 of 46SLH102session dates
29957R001Discussion3:30-4:20pmThursday42 of 45GFS116session dates
30198R001Discussion4:30-5:20pmThursday19 of 45GFS116session dates
30027R001Quiz5:00-6:50pmFriday133 of 250TBAsession dates
Information accurate as of March 9, 2015 8:11 am.