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
30105D060Lecture4:00-5:50pmMon, Wed45 of 75Shaddin DughmiONLINEsession dates
30263D060Lecture2:00-3:20pmMon, Wed68 of 76Shaddin DughmiONLINEsession dates
30264D060Lecture12:30-1:50pmTue, Thu68 of 78David KempeONLINEsession dates
30361R060Discussion10:00-11:50amFriday65 of 75Shaddin Dughmi,David KempeONLINEsession dates
30362R060Discussion12:00-1:50pmFriday63 of 75Shaddin Dughmi,David KempeONLINEsession dates
30363R060Discussion2:00-3:50pmFriday53 of 75Shaddin Dughmi,David KempeONLINEsession dates
30029R060Quiz7:00-8:50pmThursday106 of 135ONLINEsession dates
30222R060Quiz7:00-8:50pmThursday75 of 100ONLINEsession dates
Information accurate as of March 15, 2021 8:10 am.
Did you find what you needed today? Let us know by taking a short survey.