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 | 11:00-12:20pm | Tue, Thu | 28 of 40 | Aaron Cote | SSL150 |   | |
| 29960R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 34 of 40 | Leonard Adleman | SSL150 | | |
| 29961R | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 40 of 40 | Aaron Cote | VKC100 | |