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.
30008R001Lecture10:00-11:50amMon, Wed112 of 120Sandra BatistaZHS159session dates
30111R001Lecture11:00-12:20pmTue, Thu63 of 72Aleksandra KorolovaZHS252session dates
30115R001Lecture2:00-3:20pmMon, Wed92 of 95Michael ShindlerSLH102PDF (109116 KB)session dates
30116R001Discussion2:00-3:50pmFriday68 of 73GFS116session dates
30349R001Discussion4:00-5:50pmFriday61 of 72GFS116session dates
30373R001Discussion10:00-11:50amFriday69 of 73SLH102session dates
30377R001Discussion12:00-1:50pmFriday69 of 72SLH102session dates
30343R001QuizTBAThursday267 of 290OFFICEnotesession dates
Information accurate as of October 3, 2018 10:51 am.
Did you find what you needed today? Let us know by taking a short survey.