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 |
|---|---|---|---|---|---|---|---|---|---|
| 29959R | 001 | Lecture | 3:30-4:50pm | Mon, Wed | 50 of 50 | Aaron Cote | VKC102 |   | |
| 29960R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 61 of 61 | Leonard Adleman | SSL150 | | |
| 29994R | 001 | Lecture | 10:00-11:50am | Mon, Wed | 67 of 70 | Aaron Cote | GFS116 | | |
| 30029R | 001 | Quiz | 7:00-8:50pm | Thursday | 178 of 181 | TBA | |