From: Subject: CS 142 Date: Fri, 29 Aug 2008 10:08:57 -0400 MIME-Version: 1.0 Content-Type: text/html; charset="Windows-1252" Content-Transfer-Encoding: quoted-printable Content-Location: file://C:\Documents and Settings\csmith.AD\Local Settings\Temporary Internet Files\OLK55\syllabus-CS142.html X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.5579 CS 142
CS 142 Introduction to Computer Science = II=20
Fall 2008

Official Course Description. (Somewhat outdated.) This = course=20 will further develop and expand upon the topics introduced in CS 141. = Advanced=20 programming techniques will be covered, with extensive use of recursion = and=20 dynamic data structures. Abstract data types, including lists, queues, = trees and=20 graphs, will be studied. Specific emphasis will be given to tree = traversals and=20 binary search trees. Algorithms for searching and sorting will be = explored along=20 with methods of comparative analysis. The topics in this course provide = an=20 essential foundation for the further study of computer science.=20

More Accurate Description. This course further develops and = expands=20 upon the topics introduced in CS 141. It covers principles and = techniques=20 fundamental to the design and development of larger computer programs. = This=20 includes: data abstraction and object-oriented design; elementary data=20 structures such as vectors, linked lists, stacks and queues; algorithms = for=20 searching and sorting; analytical methods for evaluating the efficiency = of=20 algorithms; and the algorithm design technique of recursion. An = object-oriented=20 language such as C++ and its associated Standard Template Library will = be used=20 to illustrate the concepts and techniques. The topics in this course = provide an=20 essential foundation for the further study of computer science.=20

Prerequisites. CS141 or equivalent.=20

Location and Times. Lectures: Snell 175, TuTh 1:00-2:15. Lab: = Science=20 Center 334 (ITL), M 10:00-10:50.

Instructor. Alexis Maciel. Science Center 379, 268-2385,=20 alexis@clarkson.edu.=20

Office Hours. M 2:00-3:30, Tu 2:30-3:30, W 2:00-3:30, Th = 2:30-3:30.

Required Text. None.=20

Course Objectives.=20

  1. To teach you principles and techniques fundamental to the design = and=20 development of computer software. These include data abstraction,=20 object-oriented design, elementary data structures and algorithms, = analysis of=20 algorithms, and recursion.=20

  2. To further develop your coding, documentation, debugging and = testing=20 skills.
Demonstrable outcomes. By the end of the = semester,=20
  1. You will have a good understanding of the principles and = techniques=20 mentioned in Objective 1 above.=20

  2. You will be able to use them in the design and implementation of = C++=20 programs of a moderate size.=20

  3. You will be able to implement elementary data structures including = vectors, linked lists, stacks and queues.=20

  4. You will understand the importance of using standard software = components=20 and will be familiar with the basic data structures and algorithms = provided in=20 the C++ Standard Template Library.=20

  5. You will be able to analyze the running time of simple algorithms. =

  6. You will be able to implement simple recursive algorithms.=20

  7. You will be able to implement and analyze basic algorithms for = searching,=20 sorting and, if time permits, tree traversal.

Topics to be covered. Data abstraction, classes, = object-oriented=20 design, exceptions, linked lists, vectors, stacks, queues, iterators, = templates,=20 the STL, analysis of algorithms, recursion, binary search, quicksort, = mergesort,=20 sound programming principles. If time permits, inheritance, = polymorphism, trees=20 and binary search trees.=20

Grading. Your evaluation will be based on several homework = assignments=20 (A), which will be mostly programming assignments, two tests (T) and a = final=20 exam (F). Your course grade will be computed using the following = formula:=20

25% A + 25% T1 + 25% T2 + 25% F

The final exam will not be cumulative. At the final exam, you will = have the=20 option of writing make-up exams for Tests 1 and 2. Tentative dates for = the tests=20 are Thursday, October 9 and Thursday, November 6. These will be evening = exams.=20 All students are required to write the final exam (no exemptions).=20

Policy for missed work. There will be no make-up assignments. = Late=20 assignments may be accepted if a good excuse is provided and if = arrangements are=20 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=20 students forced to miss more than a few days of class.=20

Laptops and other electronic devices. These are permitted in = class=20 only for the purpose of taking notes. Nothing else. Please turn off your = phone=20 ringers while in class or at the lab.