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
29959R001Lecture3:30-4:50pmMon, Wed
50 of 50
Aaron CoteVKC102feesession dates
29960R001Lecture2:00-3:20pmMon, Wed
61 of 61
Leonard AdlemanSSL150feesession dates
29994R001Lecture10:00-11:50amMon, Wed67 of 70Aaron CoteGFS116feesession dates
30029R001Quiz7:00-8:50pmThursday178 of 181TBAsession dates
Information accurate as of March 7, 2016 8:09 am.