CSCI 146: Introduction to Algorithmic Design II

Prerequisites: CSCI 145 and MATH 174.

Instructor: Marco Valtorta
Office: Sumwalt 206A, 777-4879
E-mail: mgv@cs.sc.edu
Office Hours: MWF 9:15am-10:15am, TTh 9:15am-10am or by previous appointment

Labs 1 (Monday 12-1:55pm) and 2 (Monday 2-3:55)
Teaching Assistant: Magda Oros
Office: Sumwalt 234, 777-8755
E-mail: oros@cs.sc.edu
Office Hours: Wednesday 2:15-3:45, Thursday 3:30-5

Labs 3 (Tuesday 10-11:55) and 4 (Tuesday 12-1:55)
Teaching Assistant: Subhashish Dash
Office: Sumwalt 232, 777-8754
E-mail: dash@cs.sc.edu
Office Hours: W 11-1, F 11:30-12:30
Mr. Dash will be available starting at 10 on Friday, October 24.

The goals of this course, adapted from the departmental syllabus, are:

To introduce data abstraction through the use of abstract data types
To introduce data structures that are not generally provided as built-in data structures in current programming languages, such as bags, stacks, queues, linked lists, and trees.
To improve the student's ability to develop structured, modular algorithms and to provide a foundation for further studies in computer science.
To instill a discipline of developing quality programs based on good software design practice, including object-oriented programming.
To introduce the analysis of algorithms.
To lead the student to basic proficiency in the C++ programming language.

It is assumed that the students in the class have mastered the following topics, as covered in Chapters 1 through 10 of C++ Program Design: An Introduction to Programming and Object-Oriented Design, by James P. Cohoon and Jack W. Davidson, Irwin, 1997, which is the textbook used in the Spring 1997 CSCI course: