INITIATING DEPARTMENT/UNIT: Computing Sciences
DATE OF DEPARTMENT/UNIT ACTION: October 5, 2000
CONTACT PERSON: Dennis Martin
PHONE: 6115
EMAIL: martin@scranton.edu
TYPE OF PROPOSAL: NEW COURSE
LEVEL: UNDERGRADUATE
HOME DEAN'S CONFERENCE: CAS
TO BE CONSIDERED IN ABOVE DEAN'S CONFERENCE IN November 2000
BRIEF DESCRIPTION OF PROPOSAL:
(Prerequisite: CMPS 134)
A follow-up course to CMPS 134 for non-computing majors who want more object-oriented programming experience. Includes data structures, file processing, graphical user interfaces and event-driven programming. Cannot be used to satisfy the requirements of either the Computer Science or the Computer Information Systems major. Cannot be taken by a student who has credit for CMPS 144.
Text: We will use the same text as CMPS 134 the semester before. Currently, the text is
Savich, Walter. Java: An Introduction to Computer Science & Programming. Prentice-Hall, 1999.
Prerequisite knowledge:
The student is expected to be able to write, compile and debug a program in a high-level language using at least selection, iteration and procedures and functions (methods). S/he will be expected to be able to use an array data structure and either a record data structure or a class. It is expected that there may be students who have not taken their preliminary course in Java for the first few offerings of this course.
Goals:
This course will extend the student’s ability to use object-oriented programming with an emphasis on Web Programming.
Objectives:
At the end of this course, the student will be able to
· design a package of classes to perform a specified activity;
· use exception handling to prevent common user errors from aborting programs;
· use Java to enhance the activities of a Web page;
· use data structures such as array, lists, stacks and queues to support data manipulation needs of a program; and
· demonstrate the ability to obtain data from a file, store data to a file and to update a file from a program.
Contents:
A. Technical Features
1. Packages
2. Recursion
3. Inheritance
4. Exceptions
B. Data Structures
1. Arrays: single and multi-dimensional, searching, sorting
2. Lists, stacks, queues
C. File Processing
1. Sequential Access
2. Direct Access
D. Graphical User Interface
1. Applets
2. HTML
E. Event-driven programming
Evaluation:
The grade will be based 50% on tests and 50% on a series of graduated programming exercises.
SUPPORTING DOCUMENTS: None