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.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
29956R001Lecture3:30-4:50pmMon, Wed85 of 100David KempeMHP101notesession dates
29957R001Lecture12:30-1:50pmMon, Wed84 of 100David KempeTHH202notesession dates
30231R001Lecture6:00-7:20pmTue, Thu40 of 100Jiapeng ZhangMRF340notesession dates
30267R001Discussion10:00-11:50amFriday50 of 100Jiapeng ZhangSGM101session dates
30268R001Discussion12:00-1:50pmFriday93 of 100David KempeGFS106session dates
30269R001Discussion2:00-3:50pmFriday66 of 100David KempeTHH202session dates
30224R001Quiz7:00-8:50pmFriday169 of 200David KempeTBAsession dates
30385R001Quiz7:00-8:50pmFriday40 of 100Jiapeng ZhangTBAsession dates
Information accurate as of September 13, 2022 5:00 pm.
Did you find what you needed today? Let us know by taking a short survey.