COP-3337 Programming II Syllabus Page

COP-3337: Programming II

Fall 2009

COURSE TIMES:

Section 1: Tuesday and Thursday, 11:00 AM - 12:15 PM, ECS-141

PREREQUISITES: Programming I (COP-2210, or equivalent) and Discrete Math (MAD-2104). You must drop the course if you haven't gotten a C or better in a basic programming course. Basic program development skills and debugging skills are assumed. This course is lots of work. If you are thinking about taking an extra course, you are strongly encouraged to pick another semester in which to do it.

INSTRUCTOR: Prof. Mark Allen Weiss

OFFICE HOURS: You are free to stop by my office (ECS-353) any time you can find me. My office hours represent a time when I am (more or less) guaranteed to be available. This semester this is Tuesday and Thursday, 9:30 - 11:00 AM and Tuesday 2:00 - 4:00 PM. You can also contact me by email to weiss email address . My office phone is 305-FIU-2036.

LANGUAGES AND PLATFORMS: This course will be conducted in Java 6.

TEXTBOOK: The course text is Big Java, by Cay Horstmann.

COURSE GRADING: Grades will be based on five programs, five exams, and a final. Each program is worth 50 points, but the last program is worth 100 points. Each exam is worth 100 points. The final exam will be worth 200 points.

I reserve the right to change the method of assigning grades, including changing the number of assignments or exams, but in no case will a curve be applied.

PROGRAMS: Barring tragedy, I will not accept late programs. Your submission must include source code and sample output. I will generally specify what the data is. You must work on your own. The assignments and if appropriate, input data, will be placed here.

Florida International University is a community dedicated to generating and imparting knowledge through excellent teaching and research, the rigorous and respectful exchange of ideas, and community service. All students should respect the right of others to have an equitable opportunity to learn and honestly demonstrate the quality of their learning. Therefore, all students are expected to adhere to a standard of academic conduct, which demonstrates respect for themselves, their fellow students, and the educational mission of the University. All students are deemed by the University to understand that if they are found responsible for academic misconduct, they will be subject to the Academic Misconduct procedures and sanctions, as outlined in the Student Handbook.

COURSE OUTLINE

Reference Types REVIEW
- What is a Reference?
- Basics of Objects and References
- Strings
- Arrays
- Exception Handling
- Input and Output
Writing Classes REVIEW
- A Simple Example
- Constructors
- Basic Methods
- Additional Constructs: this, toString, equals
- Packages andd import directives
Inheritance
- What is Inheritance?
- Designing Hierarchies
- Multiple Inheritance
- The Interface
- Fundamental Inheritance in Java
- Implementing Generic Components Using Inheritance
- Implementing Generic Components Using Java 1.5 Generics
- The Functor (Function Objects)
Recursion
- What is Recursion?
- Background: Proofs by Mathematical Induction
- Basic Recursion
- Divide-and-Conquer Algorithms
- Backtracking
Inner Classes and Implementation of ArrayList
- Iterators and Nested Classes
- Iterators and Inner Classes
- The AbstractCollection Class
- StringBuilder
- Implementation of ArrayList with an Iterator
Stacks and Queues
- Implementations
- Applications
- The java.util.Stack Class
Linked Lists
- Basic Ideas
- Java Implementation
Introduction to the Java Collections Library
- List
- Set
- Map

Course Objectives

Master the design and implementation of classes using inheritance and polymorphism
Master the use and implementation of interfaces
Be exposed to writing recursive methods
Be familiar with the implementation of Linked List data structures
Be familiar with the Stack and Queue data structures
Be exposed to the Java Collections interface
Master analyzing problems and writing Java program solutions to those problems