Please use this identifier to cite or link to this item:
http://hdl.handle.net/10267/15835| Title: | CS 355-01, Advanced Algorithms, Spring 2012 |
| Authors: | Rice, Stephen V. |
| Keywords: | Mathematics and Computer Science, Department of;2012 Spring;Curriculum;Syllabus;Academic departments |
| Issue Date: | 20-Feb-2009 |
| Publisher: | Memphis, Tenn. : Rhodes College |
| Series/Report no.: | Syllabi CRN;22267 |
| Abstract: | An in-depth study of the design and analysis of advanced algorithms, including the performance tradeoffs and resources required by various algorithmic implementations. Major classes of computational problems will be identified and explored. Advanced data structures and approximation heuristics are introduced as required for solution design. Topics vary depending on the specific problems covered but will include the Master Theorem, dynamic programming, divide-and-conquer and greedy algorithms. |
| Description: | This syllabus was submitted to the Rhodes College Office of Academic Affairs by the course instructor. Uploaded by Archives RSA Josephine Hill. |
| URI: | http://hdl.handle.net/10267/15835 |
| Appears in Collections: | Course Syllabi |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| COMP355_Syllabus.pdf | 8.81 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.