CS 355-01, Advanced Algorithms, Spring 2012

Rice, Stephen V.

Please use this identifier to cite or link to this item: http://hdl.handle.net/10267/15835

Full metadata record

DC Field	Value	Language
dc.contributor.author	Rice, Stephen V.	-
dc.date.accessioned	2013-03-19T14:38:05Z	-
dc.date.available	2013-03-19T14:38:05Z	-
dc.date.issued	2009-02-20	-
dc.identifier.uri	http://hdl.handle.net/10267/15835	-
dc.description	This syllabus was submitted to the Rhodes College Office of Academic Affairs by the course instructor. Uploaded by Archives RSA Josephine Hill.	en_US
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Memphis, Tenn. : Rhodes College	-
dc.relation.ispartofseries	Syllabi CRN;22267	-
dc.rights	Rhodes College owns the rights to the archival digital objects in this collection. Objects are made available for educational use only and may not be used for any non-educational or commercial purpose. Approved educational uses include private research and scholarship, teaching, and student projects. For additional information please contact archives@rhodes.edu. Fees may apply.	-
dc.subject	Mathematics and Computer Science, Department of	en_US
dc.subject	2012 Spring	en_US
dc.subject	Curriculum	en_US
dc.subject	Syllabus	en_US
dc.subject	Academic departments	en_US
dc.title	CS 355-01, Advanced Algorithms, Spring 2012	en_US
dc.type	Text	en_US
Appears in Collections:	Course Syllabi

Files in This Item:

File	Description	Size	Format
COMP355_Syllabus.pdf		8.81 kB	Adobe PDF	View/Open

Show simple item record