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 |
|---|---|---|---|---|---|---|---|---|---|
| 30149R | 057 | Lecture | 9:30-11:10am | MTuW | 12 of 40 | Michael Shindler | VHE210 | PDF (106907 KB) |   |
| 30150R | 057 | Quiz | TBA | TBA | 12 of 40 | OFFICE | |