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
30033R001Lecture5:30-6:50pmMon, Wed35 of 80Shaddin DughmiGFS116feesession dates
30009R001Lecture2:00-3:20pmMon, Wed58 of 60Leonard AdlemanSSL150feesession dates
30396R001Lecture3:30-4:50pmMon, Wed66 of 70Shaddin DughmiLVL17feesession dates
30224R001Quiz7:00-8:50pmWednesday159 of 210TBAsession dates
Information accurate as of October 5, 2016 8:25 am.