For this assignment you must implement a program of your own design that demonstrates a significant number

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Assignment Objectives

After completing this assignment the student should be able to,

• Demonstrate proficiency with the concepts covered in this

Assignment Requirements

For this assignment you must implement a program of your own design that demonstrates a significant number of the 9 following concepts that we have covered in this course over the semester:

1. Writing classes to define objects that know things and do things

   1. Private instance variables to store things that object of this class must know

   2. Public getter and setter methods to provide access to the things that objects of this class know and to maintain a valid state

   3. Public methods to encapsulate the things that objects of this class must do

   4. Private methods to support and simplify the public methods

   5. Constructors to conveniently and consistently initialize object of this class to a valid state

2. Composing programs out of objects that collaborate to realize the responsibilities of the

   1. Includes Classes/object with “has a” relationships (composition)

   2. Includes Collections of like objects

3. Leveraging abstract and/or concrete base classes and/or interfaces

   1. Includes Classes/objects with “is a” relationships

   2. Using inheritance to extend the functionality of a base class

   3. Using inheritance to implement the functionality of an interface

   4. Defining and using classes with a common methods, but different (polymorphic) behavior

   5. Overriding base class or interface methods

   6. Explicitly calling base class constructors

4. Using UML to concisely describe the essential features of classes

   1. Writing UML class diagrams that detail the classes that make up a program

   2. Including attributes and operations

   3. Including visibility, data types, arguments, return values,

   4. Including relationships between classes

5. Choosing or implementing data structures that best meet the needs of a given problem

   1. Includes Justifying the use or implementation of any list or tree-like data structures in your program

6. Leveraging generics in Java

   1. Includes Explaining any use of Java’s standard library generic types

   2. Includes Implementing your own generic classes or methods

7. Using Big-O notation to describe the algorithmic complexity of an algorithm that you are using in your program

8. Writing recursive algorithms

   1. An explanation of why you are implementing a given algorithm recursively rather than iteratively

   2. Explaining, in detail, how any recursive algorithm that you use in your program works

      1. What is/are the base case(s)

      2. What is/are the recursive case(s)

• How does the algorithm insure that each recursive call is closer to the base case?

9. Choosing and using sorting algorithms

   1. Includes Explaining why you are using or implementing any algorithms you are using in your

 

 

What to turn in

For this assignment you must upload the following files by the due date.

• A .pdf file describing your project,

  • With list and explanation of which concepts/criteria your program demonstrate

    • Including how and why you project includes the application of this concept/criterion

    • Including how many points your project should score for this concept/criterion

  • All .java files that you write

  • Any additional files that your program requires to work

  • Any additional (.pdf) files that contain artifacts like UML diagrams or Big-O analysis

 

Any assignment submitted less than 24 hours after the posted due date will have 10 points deducted.

Any assignment submitted more than 24 hour after the posted due date will receive a zero in the grade book.

There are 150 points available in this rubric. The score for the assignment is out or 100, so a score of 100 will be full credit and anything over 100 will be extra credit.

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of