12:301:45 TuTh 411 Old Gymnasium 
Dr.
David Reed
207 Old Gymnasium x2583 DaveReed@creighton.edu 
This course, together with CSC 221, forms an introduction to problemsolving 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:
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 inclass exercises that will be collected and graded.
To demonstrate problem solving and programming skills, students will complete 57 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 75minute tests and a cumulative 100minute final exam.
daily quizzes/exercises  10 % 
57 programming assignments  40 % 
two 75minute tests  30 % 
100minute 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.
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.
Date  Topic  Readings  Assignments  

Jan 13 
 Chapter 1  
18 20 
 Chapters 24  
25 27 
 Chapters 69, 11  HW1: due 2/3  
Feb 1 3 
 Chapters 11 & 12  
8 10 
 Chapters 12 & 14  HW2: Due 2/17  
15 17 
 Chapter 18  
22 24 
 
Mar 1 3 
 Chapter 19  HW3: Due 3/18  
8 10 
SPRING BREAK  
15 17 
 Chapter 19  
22 24 
 HW4: Due 4/7  
29 31 
 Chapter 13  
Apr 5 7 
 
12 14 
 Chapter 20  HW5: Due 4/20  
19 21 
 HW6: Due 4/29  
26 28 
 Chapter 21  

FINAL EXAM (Thursday, 10:00  11:40) 