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
30094R001Lecture10:00-11:50amMon, Wed63 of 66Aaron CoteSLH100session datesbook list
30231R001Lecture2:00-3:20pmTue, Thu56 of 58Aaron CoteVKC100session datesbook list
30396D001Lecture2:00-3:20pmMon, Wed59 of 61Aaron CoteKDC240session datesbook list
30267R001Discussion10:00-11:50amFriday65 of 70THH210session dates
30268R001Discussion12:00-1:50pmFriday61 of 70THH208session dates
30269R001Discussion2:00-3:50pmFriday52 of 70THH210session dates
30224R001Quiz7:00-8:50pmWednesday178 of 200TBAsession dates
Information accurate as of May 21, 2019 5:43 pm.