CSC 221: Computer Programming I
Fall 2006



9:30 - 10:45 TuTh
411 Old Gymnasium
Dr. David Reed
209 Old Gymnasium      x2583
DaveReed@creighton.edu


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


Course Description

This course provides an introduction to problem solving and programming using the language Java. The process of programming is much more than just writing code. It involves analyzing the problem at hand, designing a solution, implementing and testing that solution, and critiquing results. Following the dominant model of software development, this course will emphasize an object-oriented approach to problem solving and software development.

The specific goals of this course are:

This course is intended as a first programming course, so no prior experience with computers is assumed. The problem-solving and programming techniques introduced in this course are further expanded in the follow-up course, CSC 222: Computer Programming II.


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% likelihood. To allow for unavoidable absences, the two lowest quiz grades will be dropped.

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.

It is expected that all students check their Creighton email accounts regularly. Official announcements, such as assignment revisions or class cancellations, will be distributed through Creighton email.


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
Aug 24
Course overview. (ppt/pdf)  
29
31
Computers & objects: (ppt/pdf)
    history, Alice animations.
Ch. 1  
HW1: due 9/7
Sep 5
7
Using objects: (ppt/pdf)
    BlueJ IDE, classes & objects.
Ch. 2  
HW2: due 9/19
Sep 12
14
Implementing classes: (ppt/pdf)
    fields, constructors, methods,
Ch. 3
19
21
    assignments, local variables.
Simple conditionals and expressions: (ppt/pdf)
Ch. 4, 6  
HW3: due 10/3
26
28
    if statements, mixed expressions, casting,
    internal vs. external method calls.
Oct 3
5
review
TEST 1
Oct 10
12
Interacting classes: (ppt/pdf)
    constants, cascading if-else, scope.
Ch. 5, 6  
HW4: due 10/31
17
19
NO CLASS -- FALL RECESS
24
26
sick day
Class design & Strings: (ppt/pdf)
Ch. 15.1-2
31
Nov 2
    simple graphics, objects, String methods.
class discussion/review
7
9
Repetition and modeling: (ppt/pdf)
    while loops, infinite loops,
Ch. 7  
HW5: due 11/19
14
16
    counter-driven loops, for loops,
    simulations, modeling.
Ch. 8, 9
21
23
TEST 2
NO CLASS -- THANKSGIVING
28
30
ArrayLists: (ppt/pdf)
    composite structure, get/add/remove/set,
Ch. 9, 10 HW6: due 12/8
 
Dec 5
7
    user input, Scanner.
course review: (ppt/pdf)
Dec 11
FINAL EXAM     Mon, 1:00-2:40

Access sample code from class