Course Objective:

This course is designed to provide a comprehensive understanding of Java Object Oriented programming concepts and techniques, to develop the ability to logically plan and develop programs using object-oriented programming, recursion, and data structures. Specific OOP topics in Java programming include Classes, Data Abstraction, Inheritance, and Polymorphism. Specific data structures include Linked Lists, Stacks, and Queues, Binary Search Trees, Hash Tables, Tree Sets, Tree Maps, and Hash Maps. Algorithm topics include Searching and Sorting Algorithms and recursion

Learning Outcomes:

• Students develop knowledge of basic data structures for storage and retrieval of ordered or unordered data.
  Data structures include: arrays, linked lists, binary trees, heaps, and hash tables.
• Students develop knowledge of applications of data structures including the ability to implement algorithms for the creation, insertion, deletion, searching, and sorting of each data structure.
• Students will develop applications using OOP.
• Students will implement requiring the use of data structures.

Textbooks etc.

1. Cay Horstmann Big Java, Late Objects, Any edition
   publisher: Wiley
   ISBN: 9781119330455
   NOTE: If you wish to use another textbook, please receive approval beforehand. There are other textbooks that are suitable.
2. Eclipse, or an IDE of your choice.

Evaluation:

Test 1: 25%
Test 2: 30%
Test 3: 30%
Homework: 15%




NOTE:

Canvas is used solely as a repository for your submitted work.
Canvas should not be treated as gradesheet for the course.

I. Tests

Three tests will be given during the semester. Dates are shown on the schedule.

II. Homework

Homework assignments are an important part of this course. It is essential that students complete ALL assigned programs. Assigned programs will consist of Java programming exercises and it is expected that concepts from these assignments are well understood. Java programming assignments are available on-line and on Canvas. Programs must be completed as an individual effort. Uncompiled programs will not receive more than half credit. Homework will count for 15% of your final grade with the lowest homework score dropped.




Grading Scale:

100 - 95% 94-90% 89-87% 86-83%

4.0 3.7 3.3 3.0

82-80% 79-77% 76-73% 72-70%

2.7 2.3 2.0 1.7

69-67% 66-63% 62-60% below 60%

1.3 1.0 0.7 0.0




---






Policies:

• Normal university policies concerning incomplete, etc.
• Make-up for tests requires either 2 weeks of advance notice (in case of planned absence), or a medical statement (in case of unforeseen problem).
• Credit will not be given to homework assignments turned in late.
• With the exception of one homework assignment, no extra credit work will be given during the semester. The extra credit for the one homework assignment will only be applied to homework grades of less than 100%.
• Any academic dishonesty will result in a failing grade.
• If a student has a disability that qualified for accommodations under the Americans with Disabilities Act and Section 504 of the Rehabilitation Act, she/she/they should contact Academic Success & Disability Services (ASDS). ASDS is located on the ground floor of the Armacost Library across from Human Resources and down the hall from the Jones Computer Center; their phone is 909-748-8069. The primary contact person is Amy Wilms.