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 |
|---|---|---|---|---|---|---|---|---|---|
| 30105R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 75 of 80 | Aaron Cote | SOSB2 |   | |
| 29960D | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 63 of 63 | Leonard Adleman | SSL150 | | |
| 29994R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 61 of 72 | Aaron Cote | GFS116 | | |
| 30029R | 001 | Quiz | 7:00-8:50pm | Thursday | 200 of 218 | TBA | |