CS219 Programming Fundamentals

for F2A 2007

Printer Friendly

Mission Statement: The mission of Park University, an entrepreneurial institution of learning, is to provide access to academic excellence, which will prepare learners to think critically, communicate effectively and engage in lifelong learning while serving a global community.

Vision Statement: Park University will be a renowned international leader in providing innovative educational opportunities for learners within the global society.


CS 219 Programming Fundamentals


F2A 2007 BE


Tonsmann, Guillermo


Associate Professor of Computer Science


Ph.D. Computer Science, Louisiana State University (Baton Rouge, Louisiana)
Honors B.S. Computer Science, University of South Africa (Pretoria, South Africa)
M.Eng. in Chemical Engineering, Potchefstroom University (Potchefstroom, South Africa)

Office Location

Austin Campus - Room 109

Office Hours

Tuesdays and Thursdays from 3:00pm to 5:00pm or by appointment

Daytime Phone

(512) 385-7275 ext 209



Semester Dates

Monday, October 22, 2007 through Sunday, December 16, 2007

Class Days


Class Time

8:00 - 10:40 PM



Credit Hours



Introduction to Programming and Problem Solving with Java
by John and Raymond Dean, McGraw-Hill
CS151 uses the first part of this book. In CS219 we will cover the second part of the book.
Until the book is formally published students can get a copy through our office at the Austin Campus.

Additional Resources:

McAfee Memorial Library - Online information, links, electronic databases and the Online catalog. Contact the library for further assistance via email or at 800-270-4347.
Career Counseling - The Career Development Center (CDC) provides services for all stages of career development.  The mission of the CDC is to provide the career planning tools to ensure a lifetime of career success.
Park Helpdesk - If you have forgotten your OPEN ID or Password, or need assistance with your PirateMail account, please email helpdesk@park.edu or call 800-927-3024
Resources for Current Students - A great place to look for all kinds of information http://www.park.edu/Current/.


Course Description:
This course continues the development of the programming and problem solving skills introduced in CS151. Programming concepts will be put into practice by using Java for programming projects. Students will learn about object-oriented programming and two of its key components - inheritance and polymorphism. Additionally, students will learn about these topics: arrays, graphical user interface components, event-driven programming, exception handling. Prerequisites: Any math course > MA 131, a grade of "C" or better in CS151. Suggested prerequisite: CS140 3:0:3

Educational Philosophy:

This course continues the emphasis on critical thinking, used in CS151, to solve problems that require the creation of an algorithm (a sequence of instructions to be executed by a computer). The course will expand the students' knowledge of Java and it will introduce important aspects of object oriented programming. Topics presented in lectures will be reinforced with pertinent hands-on exercises. Students are also expected to practice the solution of similar problems on their own. Whenever appropriate, the Socratic method of teaching will be favored. In this method, the instructor leads students in the search for answers to questions regarding the topic at hand by the use of their previous knowledge and critical thinking.

Learning Outcomes:
  Core Learning Outcomes

  1. Explain advanced object-oriented programming concepts - inheritance, polymorphism, exception handling, GUI programming
  2. Demonstrate creativity and problem-solving skills.
  3. Use an integrated development environment to enter, run, and debug Java programs.
  4. Debug and test Java programs.
  5. Write Java programs that use proper style and documentation.
  6. Demonstrate proper use of the object-oriented principles of inheritance and composition. -Given a problem description, the student should be able to decide on appropriate classes in a class hierarchy tree. -Given a description that involves two classes, the student should be able to decide on whether composition or inheritance is more appropriate.
  7. Write Java programs that use: -class variables and class methods -arrays and Arraylists -object-oriented programming concepts – inheritance, polymorphism -exception handling -GUI programming – event-driven programming, layout managers, components

Core Assessment:

All Park University courses must include a core assessment tool that measures the degree to which students learn the course's learning outcomes. School policy dictates that a student's performance on the core assessment tool must count for at least 20% of the student's total course grade. For this course, the tool consists of the final exam. Therefore, the final exam must count for at least 20% of the student's total course grade (preferably, it will count for more). School policy dictates that the core assessment tool must cover at least 75% of a course's learning outcomes. To ensure compliance, all CS 219 instructors are required to give the same final exam. See the attached final exam artifact and artifact solution. To prevent cheating, students are strictly forbidden from keeping the final exam, the solutions, or copies of either.

There are four categories of questions in the final exam:

Critical thinking:

(relevant learning outcomes – 2, 5, 7)

Given a problem description, produce a solution in the form of a short program or a method(s).

Exam questions: 25-26

See the exam solution for details on how to score the questions.

Communication: (relevant learning outcome – 5)

Given a problem description, produce a solution in the form of a short program or a method(s).

Short answer questions that ask the student to explain various concepts and trace and debug code fragments and/or programs.

Exam questions: 18-26

See the exam solution for details on how to score the questions.

Key discipline concepts/terminology:

(relevant learning outcomes – 1, 6, 7)

Multiple-choice and true/false questions that ask the student about CS 219 concepts.

Exam questions: 1-17

See the exam solution for details on how to score the questions.

Technical skills:

(relevant learning outcomes – 4, 7)

Short answer questions that ask the student to explain various concepts and trace and debug code fragments and/or programs.

Exam questions: 18-24

See the exam solution for details on how to score the questions.

The ICS Program Coordinator will analyze core assessment results for a sampling of all ICS courses offered. In analyzing the results, the ICS Program Coordinator will grade the exams using the (very specific) grading criteria shown on the exam solution. The final grade is in the form of a percentage where the percentages equate to the following levels of success:

Exceeds expectations

Meets expectations

Does not meet expectations

No evidence

≥ 85%

65% to 84%

< 65%

No exam graded.

The ICS Program Coordinator will use the core assessment scores to compare results across all instructional modalities.

Class Assessment:

Students are expected to:
A. Complete the reading assignments before class as indicated in the Class Schedule.
B. Participate actively in the solution of problems presented during class-time.
C. Practice on their own the solution of recommended problems
D. Complete all homework/assignments when scheduled. There will be one graded assignment per week. Relative weights on assignments may be indicated in each of this instances.
E. Complete all examinations when scheduled.


Examination 1                          20%
Examination 2                          20% 
Final Exam (Comprehensive)    20%
Homework/Assignments           40%

Grade Scale
A = 100 –90
B =  89 –80
C =  79 –70
D =  69 –60
F = below 60

Late Submission of Course Materials:

Late Submission of Course Materials:
Homework is due at the beginning of class on the stated due-date. 
Late homework may be accepted, if
 (1) such arrangement is previously established with the instructor and
 (2) evidence of progress is demonstrated on the due date.
Late assignments may carry penalties at the instructor discretion.

Classroom Rules of Conduct:

LAST DAY TO DROP:  Monday, October 29, 2007
LAST DAY TO WITHDRAW:  Tuesday, November 27, 2007

INCOMPLETE GRADE:  As a rule, incomplete grades will not be given.  Exceptions to the rule do exist, however, like a prolonged hospitalization and/or traumatic death in the family. In these cases, the student may be allowed to petition for an incomplete.  The instructor retains the right to veto any such petition, or grant an incomplete in other unforeseen circumstances.

WITHDRAW:  The enrollment status of the student in this course is solely the responsibility of the student. If a student wish to withdraw from this course, s/he must file the appropriate paperwork with the registrar before the
appropriate deadlines. Every student is considered enrolled unless s/he is officially withdrawn.

Other Rules
1. Keep a memory stick, floppy disk  and/or CDRW handy at all classes for storage of course material.
2. Students should disconnect or set to silent any cellular phones or beeping devices during class sessions.
3. Students should refrain from disruptive behavior during class sessions.
4. Students must check their account on www.parkonline.org and their Park email regularly. Class announcements and class materials will be distributed using one of both services.
5. Any enquiries regarding grades on assignments and exams have to be directed to the instructor by the student in person no longer than a week after the graded material has been returned to students in class, or a day after the final exam, whatever is the earliest.

Course Topic/Dates/Assignments:


Class Activities

Required Reading before Session

Homework Given

Homework Due Date

Tuesday Oct. 23,2007

Intro to the course.
Basic Java concepts review
Chapter 9. Classes with Class Members.
Chapter 10. Arrays (Begin).

Chapter 9 from textbook



Thursday Oct. 25,2007

Chapter 10. Arrays (continuation).

Chapter 10 from textbook

Assignment 1.


Tuesday Oct. 30,2007

Chapter 10. Arrays and 2D arrays (continuation).

Chapter 10 from textbook



Thursday Nov. 1,2007

Chapter 10. 2D arrays. ArrayList class (end).

Chapter 10 from textbook

Assignment 2: 

Assignment 1.

Tuesday Nov. 6,2007

Chapter 11. Type Details and Alternate Coding Mechanisms (begin)

Chapter 11 from textbook



Thursday Nov. 8,2007

Chapter 11. Type Details and Alternate Coding Mechanisms (end)

Chapter 11 from textbook

Assignment 3

Assignment 2.

Tuesday Nov. 13,2007

Chapter 12. Aggregation & Inheritance (begin)
Exam 1.(Chapters 9-10).

Chapters 9-10 from textbook for Exam 1.



Thursday Nov. 15,2007

Chapter 12. Aggregation & Inheritance (continue)

Chapter 12 from textbook

Assignment 4

Assignment 3

Tuesday Nov. 20,2007

Chapter 12. Aggregation & Inheritance (end)
Chapter 13. Inheritance & Polimorphism (begin)

Chapters 12 & 13 from textbook

Assignment 5

Assignment 4

Thursday Nov. 22,2007

Thanksgiving Day




Tuesday Nov. 27,2007

Chapter 13. Inheritance & Polimorphism (end).

Chapter 13 from textbook



Thursday Nov. 29,2007

Chapter 14. Exception Handling (begin)

Chapter 14 from textbook

Assignment 6

Assignment 5

Tuesday Dec. 4,2007

Chapter 14. Exception Handling (end)
Chapter 16. GUI Programming Basics (continue).

Chapters 14 & 16 from textbook.



Tuesday Dec. 6,2007

Chapter 16. GUI Programming Basics (continue).
Exam 2. (Chapters 11-13)

Chapters 11-13 from textbook for Exam 2.

Assignment 7

Assignment 6

Tuesday Dec. 11,2007

Chapter 16. GUI Programming Basics (end).
(if time allows – Chapter 17: GUI Programming – Additional details)

Chapter 16 from textbook



Thursday Dec. 13,2007

Final Exam (Comprehensive – emphasis Chapters 14, 16).

Chapters 9-14 & 16 from textbook for Final Exam


Assignment 7

Academic Honesty:
Academic integrity is the foundation of the academic community. Because each student has the primary responsibility for being academically honest, students are advised to read and understand all sections of this policy relating to standards of conduct and academic life.   Park University 2007-2008 Undergraduate Catalog Page 85-86

Plagiarism involves the use of quotations without quotation marks, the use of quotations without indication of the source, the use of another's idea without acknowledging the source, the submission of a paper, laboratory report, project, or class assignment (any portion of such) prepared by another person, or incorrect paraphrasing. Park University 2007-2008 Undergraduate Catalog Page 85

Attendance Policy:
Instructors are required to maintain attendance records and to report absences via the online attendance reporting system.

  1. The instructor may excuse absences for valid reasons, but missed work must be made up within the semester/term of enrollment.
  2. Work missed through unexcused absences must also be made up within the semester/term of enrollment.
  3. Work missed through unexcused absences must also be made up within the semester/term of enrollment, but unexcused absences may carry further penalties.
  4. In the event of two consecutive weeks of unexcused absences in a semester/term of enrollment, the student will be administratively withdrawn, resulting in a grade of "F".
  5. A "Contract for Incomplete" will not be issued to a student who has unexcused or excessive absences recorded for a course.
  6. Students receiving Military Tuition Assistance or Veterans Administration educational benefits must not exceed three unexcused absences in the semester/term of enrollment. Excessive absences will be reported to the appropriate agency and may result in a monetary penalty to the student.
  7. Report of a "F" grade (attendance or academic) resulting from excessive absence for those students who are receiving financial assistance from agencies not mentioned in item 5 above will be reported to the appropriate agency.

Park University 2007-2008 Undergraduate Catalog Page 87-88

Disability Guidelines:
Park University is committed to meeting the needs of all students that meet the criteria for special assistance. These guidelines are designed to supply directions to students concerning the information necessary to accomplish this goal. It is Park University's policy to comply fully with federal and state law, including Section 504 of the Rehabilitation Act of 1973 and the Americans with Disabilities Act of 1990, regarding students with disabilities. In the case of any inconsistency between these guidelines and federal and/or state law, the provisions of the law will apply. Additional information concerning Park University's policies and procedures related to disability can be found on the Park University web page: http://www.park.edu/disability .


This material is protected by copyright and can not be reused without author permission.

Last Updated:9/17/2007 12:09:04 PM