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
29959R001Lecture11:00-12:20pmTue, Thu49 of 50Michael ShindlerSSL150feesession datesbook list
29960R001Lecture2:00-3:20pmMon, Wed47 of 50Leonard AdlemanSSL150feesession dates
29961R001Lecture2:00-3:20pmTue, Thu54 of 55Michael ShindlerVKC100feesession datesbook list
29994R001Lecture10:00-11:50amMon, Wed50 of 51Michael ShindlerSSL150feesession datesbook list
30029R001Quiz7:00-8:50pmThursday200 of 250TBAsession dates
Information accurate as of 9/23/2014 4:03 PM.