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
29927R055Lecture2:00-4:00pmMWF21 of 30Aaron CoteGFS118session dates
29928R055Discussion2:00-4:00pmTuesday21 of 30GFS118session dates
29954R055QuizTBATBA21 of 30OFFICEsession dates
Information accurate as of February 15, 2019 2:46 pm.