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.
30136D060Lecture9:30-10:50amTue, Thu142 of 150Aaron CoteONLINEnotesession dates
30137D060Lecture11:00-12:20pmTue, Thu71 of 75Aaron CoteONLINEnotesession dates
30138D060Lecture2:00-3:20pmTue, Thu132 of 150Aaron CoteONLINEnotesession dates
29929R060Discussion4:00-5:50pmFriday89 of 95ONLINEsession dates
29954R060Discussion2:00-3:50pmFriday85 of 95ONLINEsession dates
29980R060Discussion10:00-11:50amFriday88 of 95ONLINEsession dates
30106R060Discussion12:00-1:50pmFriday83 of 95ONLINEsession dates
30027R060Quiz7:00-8:50pmWednesday345 of 375ONLINEsession dates
Information accurate as of March 15, 2021 8:10 am.
Did you find what you needed today? Let us know by taking a short survey.