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.
30159R055Lecture12:00-1:20pmMWThF25 of 30Aaron Cotesession dates
30160R055Discussion12:00-2:00pmTuesday25 of 30session dates
30161R055QuizTBATBA25 of 30OFFICEsession dates
Information accurate as of September 23, 2020 11:00 am.
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.