CS 335
Data Structures & Algorithms
Fall 2004
Instructor: Dr. Chengwen Wang.
Email:
chengwen@andromeda.rutgers.edu
URL: http://andromeda.rutgers.edu/~chengwen
Office: Smith
204 (Hours: Tuesdays
Telephone: (973)353-5800 (Ext. 15)
Class Meets: Tuesdays
Text: “Data Structures with
C++", Ford &Topp, Second Edition
PH(2002) (ISBN 0-13-085850-1)
Software: C++ Compiler (C++ or g++ on
UNIX Platform)
|
Week |
Topic |
Chapter |
|
One |
Chapter 1 |
|
|
Two |
Object Design Techniques: Software Design, Object Composition, and Operator Overloading |
Chapter 2 |
|
Three |
Introduction to Algorithms: Sort, Search, and Recursive Problem Solving |
Chapter 3 |
|
Four |
Chapter 4 |
|
|
Five |
Chapter 5 |
|
|
Six |
Chapter 6 |
|
|
Seven |
General List Insert/Erase Operations Mid-Term Exam |
Chapter 6 |
|
Eight |
Chapter 7 |
|
|
Nine |
Chapter 8 |
|
|
Ten |
The Queue ADT & Its Applications |
Chapter 8 |
|
Eleven |
Chapter 9 |
|
|
Twelve |
Building Single & Doubly-Linked Lists |
Chapter 9 |
|
Thirteen |
Chapter 10 |
|
|
Fourteen |
Tree Structures & Tree Scanning Algorithms |
Chapter 10 |
Final Exam
Quizzes: There may be a quiz every other session based on material covered in
class.
Homework: There will be regular homework assignments at the end of each
session.
Term Project: There will be one computer project covering certain topics
discussed in class.
Exams: There will be two examinations. The final exam is comprehensive.
Grading:
Homework: 10%
Quizzes:
10%
Mid-Term: 25%
Final:
40%
Project:
10%
Class participation: 05%
A
90% or above
B+
86% - 89%
B
80% - 85%
C+
76% - 79%
C
70% - 75%
D
60% - 69%
Violations of