Computer Science 241 Syllabus
for Spring 2008
Dr. Carol E. Wolf Office 163 William St. Room 215
Website: http://csis.pace.edu/~wolf E-mail: cwolf@pace.edu
Office Hours: Tuesdays 1:00 – 3:00 and
Wednesdays 1:30-3:00 Phone:
212-346-0799
Text: Carrano and
Prichard, Data Abstraction and Problem
Solving with Java: Walls and Mirrors, 2nd Edition, Addison Wesley, 2006
Week |
Date |
Topic |
1 |
|
Chapter
1: Connecting to a database Windows and frames |
2 |
|
Java review: Arrays of objects, Threads |
3 |
|
Chapter
2: Program design Chapter 4: Data abstraction |
4 |
|
Chapter 5: Linked lists The Collections Framework |
5
|
Feb 26 |
Chapter 7: Stacks Chapter 8: Queues |
6 |
|
Chapters 3: Recursion How it works, tracing execution |
7 |
|
Exam |
8 |
|
Chapter 6: More recursion Prefix, infix, postfix, BNF, Expression
parser |
9 |
Apr. 1
|
Chapter 9: More Java Inheritance, polymorphism and generics |
10 |
|
Chapter 10: Algorithm efficiency Sorting methods |
11 |
|
Chapter 11: Trees |
12 |
|
Chapter 12: Tables and priority queues |
13 |
|
Chapter 13: Hashing |
14 |
|
Final Exam |
Program grading:
Programs will be due on the date listed
on the assignment.
Programs one week late will incur no
penalty.
Programs two weeks late will lose 1/3.
Programs three weeks late will lose 2/3.
Programs four weeks late will receive
zero points.
All programs must be handed in by the
last day of classes.
Programs may be resubmitted once for
several additional points.
Grading:
The midterm and final will each be worth
1/3. All the programs together will
count for the other third. There will be
5 or 6 programming assignments