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. Prerequisites: CSCI 104L and CSCI 170. Duplicates credit in former CSCI 303.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
30009R001Lecture2:00-3:20pmMon, Wed72 of 75Shaddin DughmiGFS116feesession dates
30396D001Lecture10:00-11:50amMon, Wed81 of 82Michael ShindlerGFS116feesession dates
30224R001Quiz7:00-8:50pmWednesday153 of 164TBAsession dates
Information accurate as of October 4, 2015 4:49 pm.