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
29909R051Lecture1:00-3:30pmMWF20 of 40Aaron CoteGFS207session dates
29910R051Discussion1:00-3:30pmTuesday20 of 40VKC100session dates
29911R051QuizTBATBA20 of 40OFFICEsession dates
Information accurate as of September 22, 2019 8:00 am.