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.
30136D001Lecture9:30-10:50amTue, Thu109 of 115Victor AdamchikMHP101notesession dates
30137R001Lecture11:00-12:20pmTue, Thu213 of 240Victor AdamchikSAL101notesession dates
29929R001Discussion4:00-5:50pmFriday57 of 60GFS118session dates
29954R001Discussion2:00-3:50pmFriday55 of 60THH212session dates
29980R001Discussion10:00-11:50amFriday53 of 60THH102session dates
30106R001Discussion12:00-1:50pmFriday55 of 60GFS116session dates
30299R001Discussion12:00-1:50pmFriday43 of 60ZHS352session dates
30300R001Discussion2:00-3:50pmFriday59 of 60LVL17session dates
30027R001Quiz7:00-8:50pmWednesday322 of 360TBAsession dates
Information accurate as of March 6, 2023 7:39 am.
Did you find what you needed today? Let us know by taking a short survey.