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, Wed54 of 75Shaddin DughmiONLINEsession datesbook list
30263D060Lecture2:00-3:20pmMon, Wed75 of 76Shaddin DughmiONLINEsession datesbook list
30264D060Lecture12:30-1:50pmTue, Thu73 of 78David KempeONLINEsession datesbook list
30361R060Discussion10:00-11:50amFriday72 of 75Shaddin Dughmi,David KempeONLINEsession dates
30362R060Discussion12:00-1:50pmFriday73 of 75Shaddin Dughmi,David KempeONLINEsession dates
30363R060Discussion2:00-3:50pmFriday57 of 75Shaddin Dughmi,David KempeONLINEsession dates
30029R060Quiz7:00-8:50pmThursday119 of 135ONLINEsession dates
30222R060Quiz7:00-8:50pmThursday83 of 100ONLINEsession dates
Information accurate as of September 23, 2020 1:00 pm.
The Fall 2020 semester will begin with fully remote instruction, with limited exceptions for clinical education. Faculty will contact students to provide information to login to classes. Read more.