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.
29960R001Lecture3:30-4:50pmMon, Wed50 of 60Aaron CoteWPHB27session dates
29994R001Lecture12:00-1:50pmMon, Wed
61 of 61
Aaron CoteWPHB27session dates
30105R001Lecture2:00-3:20pmMon, Wed61 of 62Leonard AdlemanSSL150session dates
30029R001Quiz7:00-8:50pmThursday172 of 180TBAsession dates
Information accurate as of March 4, 2018 4:29 pm.