CS 142 Introduction to Computer Science II
Fall 2000

Brief Description. In this course you will learn fundamental ideas of computer science and further develop your programming skills. In particular, you will learn about data abstraction, recursion, dynamic data structures and the basic data structures: lists, stacks, queues and trees. You will be introduced to the formal analysis of algorithms and various sorting algorithms. You will also learn the basic concepts of object-oriented programming. Programming will be done in C++.

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

Office Hours. Monday through Friday 3:00--4:00, and by appointment.

Required Text.

Carrano, Helman, Veroff, Data Abstraction and Problem Solving with C++: Walls and Mirrors, 2nd ed., Addison-Wesley, 1998.

Grading.

Homework assignments

15%

Quizzes

20%

Two tests

30%

Final exam

35%

Assignments will include both written and programming exercises. The assignment policy for the course will be stated on the first assignment. The average grade on the tests and final exam will replace any lower grade on a quiz. Tentative dates for the tests: October 6 and November 8.