|
Catalog Description: |
Continues development of programming skills including design, style and expression, debugging and testing. Students learn object-oriented design using the Java programming language, and are introduced to basic algorithmic analysis, string processing, recursion, internal search/sort methods, and data structures. Two lecture periods and two laboratory periods per week. (Offered spring semester only.)
|
| Prerequisites: |
CIS 181 Computer Programming I or an understanding of the topics in the course.
|
|
Required Course Materials: |
Sharon Zakhour, Scott Hommel, Jacob Royal, Isaac Rabinovitch, Tom Risser, and Mark Hoeber, The Java Tutorial: A Short Course on the Basic, 4th edition, Addison Wesley, 2006 (ISBN:9780321334205)
|
|
Course Coordinator: |
David R. Owen, Asssociate Professor of Computer Science
|
|
Course Audience: |
Required course for Information Science majors. Mathematics majors must take this course or a second course in Statistics. Open to all students.
|
|
Course Objectives: |
|
Students who successfully complete the course will be able to:
- Understand and discuss advanced object-oriented programming concepts useful in larger
programs and code meant to be reused.
- Program effectively in Java using appropriate Java library classes for mathematical calculations, String manipulation, file I/O and basic GUI design.
- Read, write, modify, test and document programs using incremental development techniques.
- Succeed in future programming courses.
|
|
Topics: |
|
- Continue to learn and use concepts of the Java Language.
- Syntax and uses of arrays in Java.
- Syntax and use of text files and object stream file formats.
- Syntax and use of inheritance, abstract classes, and interfaces.
- Generic classes.
- Object-oriented design and implementation of medium sized applications
- Introduction to the Big O notation and the efficiency analysis of algorithms.
- Learn and use the algorithms for internal searching (linear and binary) and sorting algorithms.
- Experimental timing of algorithms and analysis of results in terms of the algorithms of the process.
- Object comparison using comparators and comparable methods.
|
| |