Header

CSC113 - Programming in Java

Syllabus, Fall 2012

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:00 p.m. (M)
Office Hours: As shown below and by appointment.

Schedule Fall 2012 

Text: Programming and Problem Solving with Java, 2nd ed; Dale & Weems; Jones and Bartlett; 2008

Prerequisites: None

COURSE OBJECTIVES

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:

ASSIGNMENT OF GRADES

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

ATTENDANCE POLICY

1. All students are expected to attend class as well as complete assignments and readings outside of class.
 
2. If a student misses a class, the individual is responsible for the work missed. 
 
3. In the case of: (a) hospitalization or serious illness (as determined by a physician), (b) Asbury University approved group event or travel (i.e., class trip, athletic team trip, etc.), (c) death or serious illness of family member, or (d) other unusual circumstance, the registrar will issue an excused absence (with permission to make up work) to be presented to the instructor.  Students may not be penalized for any absence approved by the Registrar’s Office.  Decisions regarding absences resulting from such circumstances as travel difficulties, bad weather, conflicting schedules, oversleeping, minor sickness, doctor or dentist appointments, job interviews, discretionary trips (such as weddings), and family responsibilities will be left to the discretion of the instructor.
 
4. A student may miss without excuse 4 class hours per 3 credit-hour class.
            Example: A 3 credit hour class that meets MWF may miss 4 class periods
                        A 3 credit hour class that meets TR may miss 3 class periods
 
5. A student may miss without excuse 1 class hour per 1 credit-hour class.

ACADEMIC INTEGRITY

The work (homework assignment, lab assignment, or test) submitted by a student is expected to be the product of the student alone. In this course, cheating includes unauthorized collaboration (giving or receiving help from some person) and unauthorized access to sources (including notes, cheat sheets, digital documents, and so on). Incidents of academic dishonesty will be recorded in your permanent file. In addition, the following penalties will apply:

You can find Asbury University's complete academic integrity policy in the university bulletin at the following link:

http://www.asbury.edu/offices/registrar/bulletin/academic-policies/general-policies

Exception: Minor collaboration is permitted during the lab sessions each Monday but in no case is code to be shared.

TUTORING SERVICES

The Center for Academic Excellence has tutors available to meet with you to work on a full range of academic meets. If you find yourself struggling in any of your classes, please contact them, and they will work to match you with a tutor ASAP. Services are all FREE, so take advantage of the opportunity! If there is not currently a tutor for the specific class for which you are requesting assistance, the CAE will do its best to work with your professor to find a student who can assist you.

To apply for a tutor, please locate the application on the CAE website http://www.asbury.edu/academics/cae.

The CAE is located in KL 139 (basement of Kinlaw Library). You can send emails to tutoring@asbury.edu or call at campus extension 2196.

TENTATIVE COURSE SCHEDULE

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 20 Ch 1, Introduction to Programming (Lab 1)
  22 Ch 2, The Elements of Java (Homework 1)
  24 Ch 2, The Elements of Java
     
  27 Ch 2, The Elements of Java (Lab 2)
  29 Ch 3, Classes and Methods (Homework 2)
  31 Ch 3, Classes and Methods
     
Sep 3 Labor Day (no classes)
  5 Ch 3, Classes and Methods (Homework 3)
  7 Ch 3, Classes and Methods
     
  10 Ch 4, Numeric Types (Lab 3)
  12 Ch 4, Numeric Types (Homework 4)
  14 Ch 4, Numeric Types
     
  17 Ch 4, Numeric Types (Lab 4)
  19 Ch 4, Numeric Types (Homework 5)
  21 Ch 5, Branching and Method Algorithm Design
     
  24 Ch 5, Branching and Method Algorithm Design (Lab 5)
  26 Ch 5, Branching and Method Algorithm Design (Homework 6)
  28 Ch 5, Branching and Method Algorithm Design
     
Oct 1 Ch 5, Branching and Method Algorithm Design (Lab 6)
  3 Test 1 (Homework 7)
  5 GUI: Labels, Text Fields, and Buttons
     
  8 GUI: Labels, Text Fields, and Buttons (Lab 7)
  10 GUI: Interaction (Homework 8)
  12 GUI: Interaction
     
  15 GUI: GridLayout (Lab 8)
  17 GUI: GridBagLayout (Homework 9)
  19 Fall Break (no classes)
     
  22 GUI: GridBagLayout with Panels
  24 GUI: Text Area (Homework 10)
  26 GUI: Text Area
     
  29 Ch 6, Loops and Files (Lab 9)
  31 Ch 6, Loops and Files (Homework 11)
Nov 2 Ch 6, Loops and Files
     
  5 Ch 6, Loops and Files (Lab 10)
  7 Ch 6, Loops and Files (Homework 12)
  9 Ch 6, Loops and Files
     
  12 Ch 7, Switch Statement (Lab 11)
  14 Ch 7, Looping (Homework 13)
  16 Ch 7, Exceptions
     
  19 Simulation (Lab 12)
  21 Thanksgiving Break (no classes)
  23 Thanksgiving Break (no classes)
     
  26 Ch 9, Arrays (Lab 13)
  28 Ch 9, Arrays (Homework 14)
  30 Ch 9, Arrays
     
Dec 3 Ch 9, Arrays (Lab 14)
  5 Ch 9, Arrays (Homework 15)
  7 Ch 9, Arrays
     
  10 Test 2, 10:30 a.m.