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
29955R050Lecture12:00-1:40pmMWThF12 of 50Aaron CoteGFS118session dates
29956R050Discussion12:00-2:00pmTuesday12 of 50GFS118session dates
29957R050QuizTBATBA12 of 50OFFICEsession dates
Information accurate as of January 18, 2024 10:51 am.