COMP 241-01, Data Structures and Algorithms, Fall 2004

England, Robert

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	England, Robert	-
dc.date.accessioned	2008-06-26T20:49:05Z	-
dc.date.available	2008-06-26T20:49:05Z	-
dc.date.issued	2008-06-26T20:49:05Z	-
dc.identifier.uri	http://hdl.handle.net/10267/1971	-
dc.description	This syllabus was submitted to the Rhodes College Office of Academic Affairs by the course instructor.	en_US
dc.description.abstract	This course builds on the foundation provided by the CS 141 - CS 142 sequence to introduce the fundamental concepts of data structures and the algorithms that proceed from them. We will review the underlying philosophy of object-oriented programming, explore recursion as a design strategy, carefully examine fundamental data structures (including stacks, queues, linked lists, hash tables, trees, and graphs), and cover the basics of algorithmic analysis.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Memphis, Tenn. : Rhodes College	-
dc.relation.ispartofseries	Syllabi CRN	-
dc.relation.ispartofseries	10227	-
dc.rights	Rhodes College owns the rights to the 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	Syllabus	en_US
dc.subject	Curriculum	en_US
dc.subject	Academic departments	en_US
dc.subject	2004 Fall	en_US
dc.title	COMP 241-01, Data Structures and Algorithms, Fall 2004	en_US
dc.type	Text	en_US
Appears in Collections:	Course Syllabi

Files in This Item:

File	Description	Size	Format
2004_fall_COMP_2412-01_10227.pdf		28 kB	Adobe PDF	View/Open

Show simple item record