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
30094R001Lecture10:00-11:50amMon, Wed39 of 60Aaron CoteKDC240session dates
30009R001Lecture2:00-3:20pmMon, Wed55 of 60Leonard AdlemanSSL150session dates
30396R001Lecture2:00-3:20pmMon, Wed56 of 60Aaron CoteKDC240session dates
30224R001Quiz7:00-8:50pmWednesday150 of 180THH301session dates
Information accurate as of October 3, 2018 10:51 am.