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:

• To know and use basic programming tools for object-oriented problem solving (e.g., classes, polymorphism, inheritance, interfaces)
• To appreciate the role of algorithms and data structures in problem solving and software design (e.g., objected-oriented design, searching and sorting, recursion, stacks, queues, and linked lists)
• To be able to design and implement a program to model a real-world system, and subsequently analyze its behavior.
• To develop programming skills that can serve as a foundation for further study in computer science

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.

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.

• All quizzes and tests are closed book, with no collaboration between students allowed.
• Programming assignments allow only limited collaboration. You may ask for debugging help from your peers, but at no time should another student assist in the design or coding of your program. The design and implementation of your program should be entirely your own work!

Tentative Schedule