Please use this identifier to cite or link to this item: http://hdl.handle.net/10267/15759
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSanders, Betsy Williams-
dc.date.accessioned2013-03-06T16:41:36Z-
dc.date.available2013-03-06T16:41:36Z-
dc.date.issued2009-02-04-
dc.identifier.urihttp://hdl.handle.net/10267/15759-
dc.descriptionThis 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• So far, you have acquired proficiency in programming. This course will start the process of your transformation from a programmer to a computer scientist. One of the important tasks of a computer scientist is to make efficient use of computational resources. This course will teach you about different ways of organizing the data to facilitate such efficient use, and will also discuss efficient techniques to perform some fundamental operations in computer science. • You will learn to use the techniques discussed in this course to solve commonly encountered computer science problems efficiently. This course will also teach you to analyze the efficiency your program in a mathematically rigorous manner. Material you learn in this course is critical to your becoming a good software developer later. CS 241, Fall 2010 2 of 5 • This course will focus on algorithms, analysis, and the use of basic and advanced data structures. Among the specific data structures covered are strings, stacks, records, linked lists, trees and graphs. Recursion will also be covered. Sequential and random files, hashing and indexed sequential access methods for files will be discussed. Finally, some standard computer science algorithms (sorting and searching) will be discussed. • You are free to develop the code for the assignments on your own computer. However, keep in mind that the source code that you submit for the homework assignments must run successfully on the computers in the on-campus lab. • This IS NOT a course in object-oriented programming! o This is a course about efficiency of programs and programming. In this course, we will pursue various meanings of "efficient". It is efficient to: • minimize the run time of code, especially code that is destined for re-use. • minimize the memory and storage needs of code, recognizing that there may be a trade-off between speed and memory requirements. • spend less time writing a program of equal quality. In fact, it is even more efficient to spend the same time writing a program of higher quality. • re-use code, instead of re-writing code. • select only the linguistic features you need without having to use costly extra features you do not need.en_US
dc.language.isoen_USen_US
dc.publisherMemphis, Tenn. : Rhodes College-
dc.relation.ispartofseriesSyllabi CRN;11277-
dc.rightsRhodes 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.subjectMathematics and Computer Science, Department ofen_US
dc.subject2010 Fallen_US
dc.subjectCurriculumen_US
dc.subjectSyllabusen_US
dc.subjectAcademic departmentsen_US
dc.titleCS 241-01, Computer Science III: Data Structures and Algorithms, Fall 2010en_US
dc.typeTexten_US
Appears in Collections:Course Syllabi

Files in This Item:
File Description SizeFormat 
2010_FALL_CS_241-01_11277.pdf186.2 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.