Computer Science 270:

Introduction to Algorithms and Theory of Computing (4.0 units)

Algorithm analysis. Greedy algorithms, divide and conquer, dynamic programming, graph algorithms. NP-completeness and basic recursion theory and undecidability. Sorting lower bounds. Number-theory based cryptography.
29957R001Lecture4:00-6:20pmMonday152 of 160Shahriar ShamsianSGM101notesession dates
30009R001Lecture4:00-6:20pmWednesday159 of 160Shahriar ShamsianTHH301session dates
30267R001Discussion10:00-11:50amFriday105 of 107SGM101session dates
30268R001Discussion12:00-1:50pmFriday102 of 107GFS106session dates
30269R001Discussion2:00-3:50pmFriday104 of 107THH202session dates
30224R001Quiz6:00-7:50pmFriday311 of 320TBAsession dates
Information accurate as of May 31, 2023 4:48 pm.
Did you find what you needed today? Let us know by taking a short survey.