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
29960D001Lecture12:30-1:50pmTue, Thu69 of 70Michael ShindlerGFS116PDF (126106 KB)session datesbook list
29961D001Lecture9:30-10:50amTue, Thu68 of 70Michael ShindlerSOSB46PDF (126106 KB)session datesbook list
30109D001Lecture10:00-11:50amMon, Wed66 of 70Michael ShindlerWPHB27PDF (126106 KB)session datesbook list
30361R001Discussion10:00-11:50amFriday68 of 70WPHB27session dates
30362R001Discussion12:00-1:50pmFriday69 of 70SLH102session dates
30363R001Discussion2:00-3:50pmFriday66 of 70SLH102session dates
30029R001Quiz7:00-8:50pmThursday203 of 215TBAsession dates
Information accurate as of March 11, 2019 8:08 am.