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 |
|---|---|---|---|---|---|---|---|---|---|
| 30094R | 001 | Lecture | 12:30-1:50pm | Tue, Thu | 67 of 70 | Aaron Cote | GFS116 |   | |
| 30009R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 57 of 60 | Leonard Adleman | SSL150 | | |
| 30396R | 001 | Lecture | 3:30-4:50pm | Tue, Thu | 37 of 80 | Aaron Cote | ZHS352 | | |
| 30224R | 001 | Quiz | 7:00-8:50pm | Wednesday | 161 of 210 | TBA | |