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
30109R001Lecture2:00-3:20pmMon, Wed272 of 300Aaron CoteTHH101session dates
30361R001Discussion10:00-11:50amFriday99 of 100THH301session dates
30362R001Discussion12:00-1:50pmFriday99 of 100THH102session dates
30363R001Discussion2:00-3:50pmFriday74 of 100THH301session dates
30029R001Quiz7:00-8:50pmThursday272 of 300TBAsession dates
Information accurate as of January 19, 2024 5:02 pm.