Description: Hours: Three hours lecture per week
Prerequisites: Admission to the Computer Science or Mathematics Graduate Program
Design strategies for algorithms and data structures. Theoretical limits to space and time requirements. Time/space trade-offs. Categories of problems and algorithms. Applications to business, bioinformatics, engineering, telecommunications and other disciplines. Open problems in the field.
Units: 3.00
Grading: Letter Grade
| Session | Section | Class # | Type | Days | Time | Location | Instructor | Course Details [Key] |
|---|---|---|---|---|---|---|---|---|
| E1 | 1 | 2297 | LEC | M | 06:00 PM - 09:00 PM | Sierra Hall 1121 | Natalie Miller |
|
Key for Course Detail Icons
| = Course Open |
 = Course Closed |
= Course Details |
 = Textbook Info |
 = General Education |
= Extended University |
 = Service Learning |
= In Person |
 = Asynchronous Online |
 = Synchronous Online |
 = Synchronous/Asynchronous |
 = Blended |
 = No Cost Course Materials |
 = Low Cost Course Materials |