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.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29960R | 001 | Lecture | 3:30-4:50pm | Mon, Wed | 50 of 60 | Aaron Cote | WPHB27 |  | |
| 29994R | 001 | Lecture | 12:00-1:50pm | Mon, Wed | 61 of 61 | Aaron Cote | WPHB27 | | |
| 30105R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 61 of 62 | Leonard Adleman | SSL150 | | |
| 30029R | 001 | Quiz | 7:00-8:50pm | Thursday | 172 of 180 | TBA | |