CST141: Principles of Computing Using Java

COURSE OUTLINE

TEXTBOOK AND SUPPLIES

TEXTBOOK:

or

  • Liang, Y. D.  Introduction to Java™ Programming, Brief Version, 11th Edition.  Upper Saddle River, NJ: Prentice Hall, 2018. (978-0-13-467172-7)  (This is an on-line version of the textbook from VitalSource which could save you more than half the price.)

SUPPLIES:

  • Java SE Development Kit (JDK) 11.0.4 compiler and virtual machine software from Oracle (it is important that you install the “Java JDK” compiler software before installing the remaining software)
  • BlueJ 4.2.1 Java development environment
  • Apache NetBeans IDE 11.1 ® IDE (integrated development environment)
  • USB flash drive (memory stick) or some other storage device for saving files

COURSE OBJECTIVES AND PROCEDURES

COURSE OBJECTIVES:

At the end of this course, students will be able to:

  1. Define and use various programming concepts such as problem solving, top-down design, and structure charts
     
  2. Define and use the following Java concepts:
     
    1. Constant, type and variable declarations
    2. Built-in and user-defined methods with parameters
    3. Arithmetic and Boolean expressions
    4. Assignment, selection, and repetition statements
    5. One and two dimensional arrays
    6. Objects and classes including inheritance, polymorphism, abstract classes and interfaces
    7. Strings
    8. GUI (graphical user interfaces) basics and event driven programming
    9. Exception handling
    10. Text and binary I/O
    11. Recursion

PROCEDURES FOR ACCOMPLISHING THESE OBJECTIVES:

  1. Class lectures and discussions.
  2. Use of audio-visual devices.
  3. Homework review and practice problems from textbook and other sources.
  4. Application problems on IBM compatible computers.

STUDENT REQUIREMENTS FOR COMPLETION OF THE COURSE

  • Three (3) “hands-on” in class examinations (10% each):  30%
  • Twelve (12) Java language computer programming assignments:  50%
  • Unit quizzes (see below):  20%

Do not expect to get an “A” grade for doing the base project; rather that grade is reserved for students who go beyond the requirements of the assignment.  Final grade will not be more than ten (10) percentage points higher than the examination average.

Multiple-choice unit quizzes based upon the assigned textbook readings will be given for most chapters.  Quizzes located in Blackboard consist of ten questions each and will be “open book.”  All quizzes must be completed at home or in a computer lab by the due date listed in the course outline before 12:30 p.m. when class begins that day.

ASSIGNMENTS AND EXAMS

Students must submit all projects via Blackboard, an Internet website maintained by Suffolk County Community College and the State University of New York.  Students who do not have Internet access from home can get access from the computer labs on campus.  Click on any of the following links to watch videos that demonstrate how to use Blackboard in this course.

NO MAKE-UP EXAMS will be given unless the instructor so decides.  However, no student will be allowed to make up an examination that has been returned and discussed in class.  All assignments and projects are due by the end of the day (11:59 p.m.) on the date announced unless otherwise stated.  No late assignments will be accepted unless an extension date is prearranged with the instructor.

Although computer lab time may be scheduled each week during class time, students should be aware that additional lab time outside of class may be necessary to complete the requirements of this course.  Students who do not have access to a computer of their own and/or the software used in this class should plan to spend an additional 3 to 6 hours per week in the Caumsett Hall room 207 computer lab.

ATTENDANCE

"The College expects that each student will exercise personal responsibility with regard to class attendance. All students are expected to attend every class session of each course for which they are registered. Students are responsible for all that transpires in class whether or not they are in attendance. The College defines excessive absence or lateness as more than the equivalent of one week of class meetings during the semester. Excessive absence or lateness may lead to failure in a course or removal from the class roster." (College Catalog and Student Handbook)

Attendance is not a factor in the computation of the course grade but may be a factor in determining class participation. It is the student's responsibility to make his/her attendance known to the instructor if arriving late. Students who stop attending classes without officially withdrawing from the course will receive a failing grade (F).

SCHEDULE OF TOPICS TO BE COVERED

Sept 4 – 11

Sept 16 – 23

Sept 25 – Oct 2

  • Inheritance and Polymorphism (Lecture Notes)
    • Reading:  Chapter 11 (Unit Quiz: Sept 25)
  • Project 4Triangle and GeometricObject classes (Exercise 11.1) or CommunityMember, Student, and Undergraduate or Graduate classes (not from textbook) (Due: Oct 9)

Oct 7

Oct 9 – 16

  • Exception Handling and Text I/O (Lecture Notes)
    • Reading:  Chapter 12 (Unit Quiz: Oct 9)
  • Project 5ArrayIndexOutOfBoundsException exercise (Exercise 12.3) or CupOfCoffee class (not from textbook) (Due: Oct 21)
  • Project 6Reformat Java source code exercise (Exercise 12.12) or Write/read sorted data exercise (Exercise 12.15) (Due: Oct 28)

Oct 21 – 28

Oct 30 – Nov 6

Nov 13

Nov 18 – Dec 2

Dec 4 – 11

  • Binary I/O (Lecture Notes)
    • Reading:  Chapter 17 (Unit Quiz: Dec 4)
  • Project 11 Create a binary data file/Sum all the integers in a binary data file exercise (Exercises 17.2 & 17.3) or Store Loan objects/Restore objects from a file exercise (Exercises 17.6 & 17.7) or Address book exercise (Exercise 17.9) (Due: Dec 18)

Dec 16 – 18

  • Recursion (Lecture Notes) (Console Applications Lecture Notes)
    • Reading:  Chapter 18 (Unit Quiz: Dec 16)
  • Project 12 Compute greatest common divisor using recursion exercise (Exercise 18.3) or the Sum series exercise (Exercise 18.4) or the Print the characters in a string reversely exercise (Exercise 18.9) or the Create a maze exercise (Exercise 18.26) (Due: Dec 23)

Dec 23