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
30263D001Lecture2:00-3:20pmMon, Wed113 of 115Aaron CoteMRF340session dates
30245D001Discussion8:00-9:50amFriday41 of 75ZHS352session dates
30361R001Discussion10:00-11:50amFriday72 of 75THH301session dates
30029R001Quiz7:00-8:50pmThursday113 of 150TBAsession dates
29959R001Lecture3:30-4:50pmMon, Wed69 of 115Shaddin DughmiSGM101session dates
30362R001Discussion12:00-1:50pmFriday44 of 75WPHB27session dates
30363R001Discussion2:00-3:50pmFriday25 of 75WPHB27session dates
30222R001Quiz7:00-8:50pmThursday69 of 150TBAsession dates
Information accurate as of February 7, 2022 7:48 am.