Official Course Description. (Somewhat outdated.) This course will further develop and expand upon the topics introduced in CS 141. Advanced programming techniques will be covered, with extensive use of recursion and dynamic data structures. Abstract data types, including lists, queues, trees and graphs, will be studied. Specific emphasis will be given to tree traversals and binary search trees. Algorithms for searching and sorting will be explored along with methods of comparative analysis. The topics in this course provide an essential foundation for the further study of computer science.
More Accurate Description. This course develops and expands upon the topics introduced in CS 141. It cover principles and techniques fundamental to the design and development of larger computer programs. This includes: data abstraction and object-oriented design; elementary data structures such as vectors, linked lists, stacks and queues; algorithms for searching and sorting; analytical methods for evaluating the efficiency of algorithms; and the algorithm design technique of recursion. An object-oriented language such as C++ and its associated Standard Template Library will be used to illustrate the concepts and techniques. The topics in this course provide an essential foundation for the further study of computer science.
Prerequisites. CS141 or equivalent.
Location and Times. Lab: Science Center 334 (ITL), M 10:00-10:50. Lectures: Snell 175, TuTh 1:00-2:15.
Instructor. Alexis Maciel. Science Center 379, 268-2385, firstname.lastname@example.org.
Office Hours. M 2:30-4:30, W 9:30-11:30, Th 9:30-10:30.
Required Text. None.
Topics to be covered. Data abstraction, classes, object-oriented design, exceptions, linked lists, vectors, stacks, queues, iterators, templates, the STL, analysis of algorithms, recursion, binary search, quicksort, mergesort, sound programming principles. If time permits, inheritance, polymorphism, trees and binary search trees.
Grading. Your evaluation will be based on several homework assignments, which will be mostly programming assignments, two tests, two self-assessments of your performance on the tests, one for each test, and a final exam. Your course grade will be computed using the following formula:
At the final exam, you will have the option of writing a make-up exam that can replace half of each of the two tests. The minimum grade you can get on a self-assessment is the grade you got on the corresponding test. Tentative dates for the tests are Tuesday, October 10 and Wednesday, November 8. These will be evening exams. All students are required to write the final exam (no exemptions).
Policy for missed work. There will be no make-up assignments. Late assignments may be accepted if a good excuse is provided and if arrangements are made at a reasonable time, in advance, if possible. Make-up tests can be arranged under the same conditions. Other special arrangements can be made for students forced to miss more than a few days of class.