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.
29919R055Lecture1:40-3:00pmMWThF36 of 50Aaron CoteONLINEsession dates
29920R055Discussion1:40-3:40pmTuesday36 of 50ONLINEsession dates
29921R055QuizTBATBA36 of 50TBAsession dates
Information accurate as of January 18, 2022 10:58 am.