Computer Science 122
Syllabus for Spring 2002
Dr. Carol E. Wolf
Office 156 William St. 12th floor
Website: http://csis.pace.edu/~wolf
E-mail: wolf@pace.edu
Office Hours: Tuesdays and Thursdays 3:30-4:30, Wednesdays 1-4
Java tutoring will be available afternoons on the 12th floor of 156 William St.

Text: Lewis, John and William Loftus, Java Software Solutions, Addison-Wesley, 2000, 2nd Edition.

 

Worksheet with Grades

Assignment 1

Assignment 2 File Reading Example

Array Example

Assignment 3 A list with an array of objects

Temperature Conversion Example

Orders Example

Assignment 4 Figures Example

Assignment 5

Assignment 6

List Box Example CheckBox Example Scroll Bar Example

Linked List Example

Assignment 7

Assignment 8 Order Example with a Frame and a Saved Method

Assignment 9 Add Frame Example

Fruit Thread Example Solar

Searching Methods

The final exam will be May 14, 12:50-2:30
 
Week Date Topic
1
Jan 22, 24 Java review: packages, projects, objects, references, Strings, sequential files, arrays
Design exercise introduction
2
Jan 29, 31 Java review: Sequential files, reading from a file into an array of objects
Multi-dimensional arrays
Chapter 7: Inheritance, polymorphism
3
Feb 5, 7 Chapter 9: Graphical user interfaces: Windows, Labels, Text Fields
Events, Buttons, Panels and Grid Layout.
4
Feb 12, 14 Chapter 12: Linked data structures: stacks, queues, lists
5
Feb 19, 21 Stacks and Lists
6
Feb 26, 28 Recursion: using a stack for method activation
7
Mar 5 Chapter 9: More components: Text Areas, Lists, Choices, Scrollbars.
Review
  Mar 7 Exam
8
Mar 19, 21 Prefix, infix and postfix expressions 
9
Mar 26, Apr 2 Lists, adding to front, middle and rear
10
Apr 4, 9 Chapter 9: Layout managers: Flow Layout, Border Layout, Box Layout, Card Layout, and Grid Bag Layout, Threads, Review
11
Apr 11 Exam 
  Apr 16 Introduction to algorithm analysis, counting loops
12, 13
Apr 18, 23, 25 Chapter 6: Searching, sequential, binary
Sorting, selection, Shell sort, quicksort
13
May 2 Review.
  May 14 Final Exam, 12:50-2:30

Each exam will count 100 points including the final. Programs are to be worked on the computer. They will be worth between 5 and 15 points each. All points earned either from programs or exams will be totaled and averaged. Final grading will be based on this course average. Late homework will be accepted without penalty for one week. After that grades will be reduced. All programs must be completed before the end of the semester. Attendance is required. Over 3 unexcused absences will result in a reduction in grade for the semester.