Official Course Description. 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.
Prerequisites. CS141 or equivalent.
Location and Times. Science Center 360, MWF 3:00-4:00.
Instructor. Alexis Maciel. Science Center 379, 268-2385, alexis@clarkson.edu.
Office Hours. MWThF 2:00-3:00, Tu 1:30-2:30, and by appointment.
Required Text.
Course Objectives.
Topics to be covered. Data abstraction, classes, lists, stacks, queues, linked structures, inheritance, polymorphism, analysis of algorithms, recursion, sound programming principles and, if time permits, trees.
Grading. Final grades in the course will be computed according to the following scheme:
Homework assignments | 15% |
Quizzes | 20% |
Two tests | 30% |
Final exam | 35% |
The average grade on the tests and the final exam will replace any lower grade on a quiz. Tentative dates for the tests: February 20 and April 3, in class. All students are required to write the final exam (no A or B exemptions).
Policy for missed work. There will be no make-up assignments or quizzes. 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.