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, Wed
77 of 75
Shaddin DughmiGFS116feesession datesbook list
30396D001Lecture10:00-11:50amMon, Wed
82 of 82
Michael ShindlerGFS116feesession datesbook list
30224R001Quiz7:00-8:50pmWednesday159 of 164TBAsession datesbook list
Information accurate as of 3/11/2015 2:55 PM.