Computer Science 303:
Design and Analysis of Algorithms (3.0 units)
Upper and lower bounds on sorting and order median. Deterministic and random computation, data structures, NP-completeness, cryptography, Turing machines and undecidability.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29939R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | 30 of 80 | Leonard Adleman | SLH102 |   |