Syllabus, Fall 2010
Three (3) Credit Hours
Class Room: HR 308
Class Time: 9:00 - 9:50 a.m. (M, W, F)
Lab Room: HR 314
Lab Time: 3:00 - 5:30 p.m. (M)
Office Hours: As shown below and by appointment.
Text: Programming and Problem Solving with Java; Dale & Weems; Jones and Bartlett; 2008
Prerequisites: None
This course is an introduction to the design, implementation, and testing of computer programs using the Java programming language. The material covered includes primitive data types, simple data structures, classes and objects, conditional and iterative control structures, input and output, file processing, common processing algorithms and elementary graphical user interfaces. A student successfully completing this course will be able to:
The only way to learn how to write computer programs is to write computer programs. Consequently, this course may require more homework than some other courses you have taken. Grades will be based on the following activities:
1. Fourteen lab assignments worth 15 points each. Lab assignments are given every Monday and are to be submitted via email. Each lab assignment is due at 9:00 a.m. on the following Wednesday (whether the class meets that day or not). The lowest lab score will be dropped.
2. Fifteen homework assignments worth 10 points each. Homework assignments are given every Wednesday and are to be submitted via email. Each homework assignment is due at 9:00 a.m. on the following Monday (whether class meets that day or not). The lowest homework score will be dropped.
3. Two comprehensive exams worth 100 points each. Each exam covers material from the beginning of the semester up to the most recent material covered. The second exam will be given during the normal final exam period.
Letter grades are assigned on the basis of the number of points earned out of the 535 points possible:
|
Grade
|
Points
|
| A | 498 - 535 |
| A- | 482 - 497 |
| B+ | 466 - 481 |
| B | 445 - 465 |
| B- | 428 - 444 |
| C+ | 412 - 427 |
| C | 391 - 411 |
| C- | 375 - 390 |
| D | 321 - 374 |
| F | 000 - 320 |
In CSC 113, a student absent sixteen or more times will receive a grade of "N" (no credit) unless the student would otherwise receive an "F". A student is absent if (s)he is not present when roll is taken. Note that under this policy there is no such thing as a "tardy". Make-up tests will be given only if the student arranges it ahead of time or if the absence is officially excused.
If the day of the month appears as a link, it refers to sample Java code for that day. Sometimes, the code for the day will be available before class. In that case, you may find it helpful to print out the code and bring it with you to class. Other times, the code will be available for you to view after we have worked on it together in class.
| Month | Day | Activity or Material Covered |
| Aug | 23 | Ch 1, Introduction to Programming (Lab 1) |
| 25 | Ch 2, The Elements of Java (Homework 1) | |
| 27 | Ch 2, The Elements of Java | |
| 30 | Ch 2, The Elements of Java (Lab 2) | |
| Sep | 1 | Ch 3, Classes and Methods (Homework 2) |
| 3 | Ch 3, Classes and Methods | |
| 6 | Labor Day (no classes) | |
| 8 | Ch 3, Classes and Methods (Homework 3) | |
| 10 | Ch 3, Classes and Methods | |
| 13 | Ch 4, Numeric Types (Lab 3) | |
| 15 | Ch 4, Numeric Types (Homework 4) | |
| 17 | Ch 4, Numeric Types | |
| 20 | Ch 4, Numeric Types (Lab 4) | |
| 22 | Ch 4, Numeric Types (Homework 5) | |
| 24 | Ch 5, Branching and Method Algorithm Design | |
| 27 | Ch 5, Branching and Method Algorithm Design (Lab 5) | |
| 29 | Ch 5, Branching and Method Algorithm Design (Homework 6) | |
| Oct | 1 | Ch 5, Branching and Method Algorithm Design |
| 4 | Ch 5, Branching and Method Algorithm Design (Lab 6) | |
| 6 | Test 1 (Homework 7) | |
| 8 | GUI: Labels, Text Fields, and Buttons | |
| 11 | GUI: Labels, Text Fields, and Buttons (Lab 7) | |
| 13 | GUI: Interaction (Homework 8) | |
| 15 | GUI: Interaction | |
| 18 | GUI: GridLayout (Lab 8) | |
| 20 | GUI: GridBagLayout (Homework 9) - Assessment Day | |
| 22 | GUI: GridBagLayout with Panels | |
| 25 | Fall Break (no classes) | |
| 27 | GUI: Text Area (Homework 10) | |
| 29 | GUI: Text Area | |
| Nov | 1 | Ch 6, Loops and Files (Lab 9) |
| 3 | Ch 6, Loops and Files (Homework 11) | |
| 5 | Ch 6, Loops and Files | |
| 8 | Ch 6, Loops and Files (Lab 10) | |
| 10 | Ch 6, Loops and Files (Homework 12) | |
| 12 | Ch 6, Loops and Files | |
| 15 | Ch 7, Switch Statement (Lab 11) | |
| 17 | Ch 7, Looping (Homework 13) | |
| 19 | Ch 7, Exceptions | |
| 22 | Simulation (Lab 12) | |
| 24 | Thanksgiving Break (no classes) | |
| 26 | Thanksgiving Break (no classes) | |
| 29 | Ch 9, Arrays (Lab 13) | |
| Dec | 1 | Ch 9, Arrays (Homework 14) |
| 3 | Ch 9, Arrays | |
| 6 | Ch 9, Arrays (Lab 14) | |
| 8 | Ch 9, Arrays (Homework 15) | |
| 10 | Ch 9, Arrays | |
| 15 | Test 2, 8:00 a.m. |