CSC 222: Computer Programming II
Spring 2005

12:30-1:45 TuTh
411 Old Gymnasium
Dr. David Reed
207 Old Gymnasium      x2583

Text: Java Concepts, 4th edition, Cay Horstmann, John Wiley & Sons, 2005.

Course Description

This course, together with CSC 221, forms an introduction to problem-solving and programming using the language Java. Building upon CSC 221, this course focuses on the design and analysis of larger, more complex programs. The process of breaking down a complex problem into manageable pieces and building a working system will be stressed throughout. Since part of this process is choosing the appropriate algorithm to solve the problem at hand, we will investigate the design and analysis of some standard and useful algorithms. Similarly, we will consider various ways of structuring and transforming information so as to make it efficiently accessible and manageable.

Specific topics covered in the course will include: basic Java programming and data structures (e.g., arrays, references, classes), defining and using abstract data types (e.g., lists, stacks, queues), static vs. dynamic implementations of data structures, and recursion as an alternative to iteration. The structures and concepts covered in this class will be a starting point for further development in subsequent computer science courses.

The specific goals of this course are:

Required Work

Learning to program requires a consistent time committment, as each new concept and programming technique builds on those that came before. To encourage students to keep up with the course content and to provide immediate feedback, each class period will begin with a "random" quiz. A quiz will be handed out to highlight important concepts, but only admistered with a 50% likelyhood. To allow for unavoidable absences, the two lowest quiz grades will be dropped. Periodically, there will be in-class exercises that will be collected and graded.

To demonstrate problem solving and programming skills, students will complete 5-7 programs throughout the semester. Each assignment will involve the design and implementation of a Java program, and may also include a written component in which the behavior of the program is analyzed. Late assignments will be accepted up to 7 days after their due date, with a 25% penalty. Beyond 7 days, late submissions will not be accepted.

In addition, there will be two 75-minute tests and a cumulative 100-minute final exam.

daily quizzes/exercises 10 %
5-7 programming assignments 40 %
two 75-minute tests 30 %
100-minute final exam 20 %

The final grade for the course will be based on the above weightings. At the minimum, traditional grading cutoffs for the final average will apply. That is, 90% is guaranteed an A, 87% is guaranteed a B+, etc. Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.

Regular attendance is expected of all students. If you must miss class for a legitimate reason, it is your responsibility to make up missed work. Quizzes and assignments will not be rescheduled except in extreme circumstances.

Policy on Collaboration

The college policy on cheating and plagiarism is spelled out in the Student Handbook. In addition to this, the following guidelines hold for this course.

Violations of the above collaboration will be dealt with severely, with possible outcomes including failure in the course. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.

Tentative Schedule

Date Topic Readings Assignments
Jan 13
Introduction, overview. (ppt)
Chapter 1
Java/221 review,
   classes, objects, control statements,
Chapters 2-4
   main, String, ArrayList.
Interfaces, polymorphism,
Chapters 6-9, 11 HW1: due 2/3
Feb 1
   inner classes, timer events.
Event handling, listeners,
Chapters 11 & 12
   buttons, labels, text fields,
   text areas, panel layout.
Chapters 12 & 14 HW2: Due 2/17
Recursion, recursive methods,
   recursive classes, efficiency.
Chapter 18
Mar 1
Searching, efficiency, big Oh,
   sequential vs. binary search.
Chapter 19 HW3: Due 3/18
   in-class exercise
Sorting, insertion & selection sorts,
Chapter 19
   recursion, merge sort,
   big-Oh analysis.
HW4: Due 4/7
in-class exercise
Chapter 13
Apr 5
   is-a relationship, polymorphism.
Data structures, stacks,
   recursion & run-time stack.
Chapter 20 HW5: Due 4/20
Queues, simulation,
   lab time,
HW6: Due 4/29
   linked lists.
course overview
Chapter 21
May 5
FINAL EXAM     (Thursday, 10:00 - 11:40)