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
29959D001Lecture12:00-1:20pmMon, Wed76 of 83Leonard AdlemanSLH102notesession dates
30361R001Discussion10:00-11:50amFriday76 of 83GFS116session dates
30222R001QuizTBATBA76 of 83OFFICEsession dates
30105D001Lecture3:30-4:50pmTue, Thu35 of 37Joseph BebelVKC203session dates
30263D001Lecture11:00-12:20pmTue, Thu52 of 56Joseph BebelVKC150session dates
30264D001Lecture12:30-1:50pmTue, Thu72 of 74Joseph BebelLVL17session dates
30362R001Discussion12:00-1:50pmFriday79 of 85MRF340session dates
30363R001Discussion2:00-3:50pmFriday80 of 82MRF340session dates
30029R001Quiz7:00-8:50pmThursday159 of 167TBAsession dates
Information accurate as of March 9, 2020 7:44 am.
All Summer 2020 courses will be taught remotely. Faculty will contact students to provide information to login to classes.