Instructor: Janet E. Burge, 205V Benton Hall, 9-0347, burgeje-at-muohio.edu
Office Hours: M: 2:15 - 3:15; T: 4-5; Th: 1:30-2:30; F: 2:15-3:15
Prerequisite: A 'C-' or higher in CSA 174
Required Text: Savitch, Absolute Java, 4th Edition (3rd or 2nd ok too!)
Additional References: See Course Documents on myMiami
Jump to the syllabus
Catalog Description: The design and implementation of software using object-oriented programming techniques that include inheritance, polymorphism, and composition. Students will analyze program specifications and identify appropriate objects and classes. Additional programming topics include recursion, using existing class libraries, exception handling, file IO and graphical user interfaces.
Course Learning Objectives:
- Design and implement programs using object-oriented programming techniques
- Use 3rd party class libraries to assist in problem solving
- Develop applications that incorporate exception handling
- Develop applications that include a graphical user interface (GUI)
- Store and retrieve data from permanent storage using an ASCII and binary data format
- Use recursion as a problem solving technique
- Use standard collection classes such as associative arrays and sets
Thus, at the end of the course , students will be able to:
CSA 271.1: To be able to design and implement computer programs using object oriented programming techniques
CSA 271.1.1 Implement basic control structures, nested control structures, well-specified classes, single and multi-dimensional arrays, input and output methods, and string methods as learned in CSA 174
CSA 271.1.2 Use class libraries to assist in problem solving
CSA 271.1.3 Make appropriate use of inheritance, polymorphism, composition, abstract classes, and interfaces.
CSA 271.1.4 Make appropriate use of two or more collection classes
CSA 271.1.5 Write basic UML class diagrams.
CSA 271.1.6 Break a programming problem down into an appropriate set of classes and identify appropriate methods for each class, and explain the design choices made
CSA 271.1.7 Research and use classes not studied in the course to address problems
CSA271.1.8 Interpret a UML diagram and explain its relationship to a problem statement
CSA 271.1.9 Read and understand code written by people other than themselves
CSA 271.1.10 Describe, trace, and implement bubble sort, selection sort, and/or insertion sort
CSA 271.1.11 Be able to use library routines for searching and sorting data
CSA 271.2: To be able to write robust programs
CSA 271.2.1 Resolve compilation errors, validate program input, use the debugger to locate logic errors, and generate basic test cases as learned in CSA 174.
CSA 271.2.2 Design and document a complete set of test cases and use this to identify logic errors.
CSA 271.2.3 Effectively use exception handling features to write exception classes, handle exceptions, and throw problem specific exceptions.
CSA 271.3: To be able to use permanent storage to preserve the state of a program
CSA 271.3.1 Read and write data to text files.
CSA 271.3.2 Read and write data and objects to binary files
CSA 271.4: To be able to use recursion as a problem solving technique
CSA 271.4.1 Trace through recursive computations.
CSA 271.4.2 Recognize problem situations where recursion is appropriate and write recursive methods that process both numeric and structured data.
CSA 271.4.3 Describe and implement the mergesort and quicksort algorithms
CSA 271.5: To be able to design and develop applications with a graphical user interface
CSA 271.5.1 Use fundamental classes to design a rudimentary, but functional, user interface
CSA271.6: To be able to document software processes, requirements, design, and code
CSA 271.6.1 Use a problem statement to define a set of software requirements
CSA 271.6.2 Explain how a final software implementation deviated from their original design
CSA 271.6.3 Follow good programming style and documentation conventions to write code that is easily understandable and extensible
CSA 271.6.4 Explain issues encountered and progress made during a software development project
Syllabus: Note: topics, dates, and assignments are subject to change at instructors discretion. Most projects are due shortly before midnight. You have two "late days" that can be used at any point during the semester except for the final project. Once the late days have been used up, any late projects will receive no credit.
Note that readings are somewhat approximate.
CSA 271 Syllabus
Week |
Date |
Topics |
Readings |
Assignments Due |
1 |
8/24 |
Class Intro |
Ch. 1-6 (review from 174) |
|
|
8/28 |
Inheritance |
Ch. 7.1 |
|
2 |
8/31 |
Superclasses/Encapsulation/Equals |
Ch. 7.2-7.3 |
|
|
9/4 |
Casting/Polymorphism |
Ch. 8.1 |
Project 1 (Review): Due 9/3 Write-up Due 9/4 |
3 |
9/7 |
Labor Day - no class |
|
|
|
9/11 |
Polymorphism |
Ch. 8.1 |
|
4 |
9/14 |
Abstract Classes |
Ch. 8.2 |
Project 2 (Inheritance): Due 9/15; Writeup due 9/16 |
|
9/18 |
Interfaces |
Ch. 13.1 |
|
5 |
9/21 |
Array List |
Ch. 14.1 |
Project 3 (Polymorphism & Abstract classes): Due 9/23; Writeup due 9/24
|
|
9/25 |
Testing |
Notes |
|
6 |
9/28 |
Basic Design/UML |
Ch. 12.1 |
|
|
9/30 |
Exam 1: 7 pm |
|
|
| |
10/2 |
Basic Design |
Ch. 12.2 |
|
7 |
10/5 |
GUI |
Ch. 17.1-17.2 |
Project 4 (ArrayList) Due 10/6; Writeup due 10/7 |
|
10/9 |
GUI |
Ch. 17.3 |
|
8 |
10/12 |
GUI |
Ch. 17.4-17.5 |
Project 5: (Requirements/Design/OO Programming): Requirements part due IN CLASS on paper |
|
10/16 |
Fall Break - no classes |
|
|
9 |
10/19 |
No class - Exam 1 break |
|
|
|
10/23 |
GUI/Exceptions |
|
Project 5 (Design - UML), due IN CLASS, on paper, typed |
10 |
10/26 |
Exceptions |
Ch. 9.1-9.3 |
|
|
10/30 |
Text File IO |
Ch. 10.1-10.3 |
Project 5 (Implementation), due 10/30; writeup due 10/31 |
11 |
11/2 |
Binary File IO |
Ch. 10.4 |
|
| |
11/4 |
Exam 2 |
|
|
|
11/6 |
Sorting (non-recursive) |
Notes |
|
12 |
11/9 |
Reading Recursion |
Ch. 11.1 |
|
|
11/13 |
Recursive Problem Solving |
Ch. 11.2-11.3 |
Project 6 (GUI), due 11/13; writeup due 11/14
|
13 |
11/16 |
Recursive Problem Solving/Searching |
|
|
|
11/20 |
Sorting |
Notes |
|
14 |
11/23 |
Sorting |
Notes |
Project 7 (Exceptions; File IO), due 11/24; writeup due 10/25 |
|
11/27 |
Thanksgiving Holiday - No Class |
|
|
15 |
11/30 |
No class - Exam 2 break |
|
|
| |
12/4 |
Collections |
Ch. 16.1-16.2 |
|
16 |
12/7 |
References in Java |
Notes |
|
|
12/11 |
Demonstrations |
|
Project 8: Final Project , due 12/10; Writeup due 12/11 |
17 |
TBD |
Final Exams |
|
|
Grading: The final grade for CSA271 is based on the following:
| Assignment |
Percentage |
Attendance/In-class assignments/quizzes/labs
|
10% |
Projects (Note: to obtain a grade of C- or higher you must get 60% of the project points)
- Project 1 Review (3)
- Project 2 Inheritance (4)
- Project 3 Polymorphism and Abstract Classes (5)
- Project 4 Array List (4)
- Project 5 Design/OO Programming (7)
- Project 6 GUI (5)
- Project 7 File IO and Exceptions (5)
- Project 8 Final (7)
|
40% |
Exams
- Exam 1 (15)
- Exam 2 (15)
- Final Exam (20)
|
50% |
Grading Policy: Numeric grades will be given for all assignments.
| 98-100 = A+ |
92-97.9 = A |
90-91.9 = A- |
| 88-89.9 = B+ |
82-87.9 = B |
80-81.9 = B- |
| 78-79.9 = C+ |
72-77.9 = C |
70 - 71.9 = C- |
| 68-69.9 = D+ |
62-67.9 = D |
60-61.9 = D- |
| < 59.9 = F |
|
|
Academic Honesty: All work assigned as individual work must be done as individual work and in accordance with the departmental Academic Integrity statement. Violations will be handled in accordance with the Miami University Academic Honesty Policy.
|
