CSC 221: Computer Programming I
Spring 2010



12:30 - 1:45 TuTh
3411 Old Gymnasium
Dr. David Reed
209 Old Gymnasium      x2583
DaveReed@creighton.edu


Text: Big Java, 3rd edition, Cay Horstmann, John Wiley & Sons, 2008.


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
Jan 14
Course overview. (ppt/pdf)    
19
21
Programming in Scratch: (ppt/pdf)
     motion, control, sensing,
reference
concepts
HW1: due 2/2
 
26
28
     costumes, variables, interaction.
Computing history & background. (ppt/pdf)
 
Ch. 1
 
Feb 2
4
Java objects: (ppt/pdf)
    BlueJ IDE, classes & objects.
Ch. 2, 3 HW2: due 2/11
 
9
11
Implementing classes: (ppt/pdf)
    fields, constructors, methods, local variables.
Ch. 3, 4  
 
16
18
Conditionals and expressions: (ppt/pdf)
    if statements, mixed expressions, casting.
Ch. 5 HW3: due 2/23
 
23
25
review
TEST 1
Mar 2
4
Interaction and design: (ppt/pdf)
    interacting classes, modular design,
Ch. 6  
HW4: due 3/19
9
11
NO CLASS -- SPRING BREAK
16
18
    constants, scope, logical operators.
Repetition and simulations: (ppt/pdf)
Ch. 6  
 
23
25
    while loops, logic- vs. counter-driven,
    for loops, modeling & simulations.
Ch. 8  
HW5: due 4/6
30
Apr 1
Design and text processing: (ppt/pdf)
    cohesion, coupling, String methods.
 
 
6
8
review
TEST 2
13
15
ArrayLists: (ppt/pdf)
    ArrayList methods, files.
Ch. 7  
HW6: due 4/22
20
22
ArrayLists and arrays: (ppt/pdf)
    arrays, tradeoffs, parallel lists,
 
HW7: due 4/30
27
29
    Skip-3 application.
course review (ppt/pdf)
 
 
May 6
FINAL EXAM     Thu, 10:00-11:40

Access sample code from class



In the event of disruption of normal classroom activities due to an H1N1 flu outbreak or other emergency, the format for this course may be modified to enable completion of the course. In that event, you will be provided an addendum to this syllabus that will supersede this version.