Codingassignmenthelper | Home Codingassignmenthelper | University

BTP400 Assignment 1 - (15%)

Dr. Eden Burton School of ICT, Seneca College of Applied Arts and Technology Winter 2019

Assignment :

Introduction :

  Please read the instructions carefully and follow the naming conventions specified for each question. Solutions must be submitted in the Blackboard Dropbox created for Assignment 1.
  The deliverable will be question solutions placed a single package named btp400.ass1. The submission shall be in a single jar file (called btp400ass1.jar) which contains both source (*.java) and bytecode (*class) files.Your solution should be well documented using the JavaDoc utility to describe both your interface and your solution design.
  Not+ that the deadline is strictly enforced. The system tracks the exact time that submissions are uploaded. There is a 10% per day penalty for late submissions.

Additional Notes

You may optionally work in groups. Groups can have no more than 3 members. Your group members must register in a Blackboard group as speci ed in the assignment. Only one submission is required per group and all group members will receive the same grade. Ensure that all group members register with the same Blackboard group. Groups of one must also register to allow submission. You must provide appropriate test case classes with your solution. Document any assumptions you make about the requirements. You will have to organize your code in a way such that the JUnit test runner does not require user input. Groups will be required to present and explain their solution to the professor during the lab period. You may use any IDE for development but note that demonstrations and professor testing will be done exclusively on the command line.

Case Description

Your task is to build a system which models a car assembly line. A car goes through a set of stations, with each station tasked with doing a part of the assembly process. The car is completely built when it has passed through all stations required. when a car is ordered by a customer, it is associated with a job. The job should store an ordered list of the assembly tasks required for the car to be produced. a task can be considered either mandatory or optional a task can be identified as initial, intermediate or nal a car be ordered with optional features so it is possible for cars to require different assembly tasks. A job should be checked to make sure that its assembly task list is valid. Without getting too complex, it should ensure the following properties. task shall occur more than once in the job list all mandatory tasks shall be in the list a task at the beginning of the list is initial a task at the end is final each station is con gured to do a single task. Stations which do initial tasks accept jobs from an input le and push jobs out to other stations. Stations doing nal tasks accept input jobs and write to a "completed" job report after they have been processed. Finally, intermediate stations accept and push jobs to other stations. For the simulation to be realistic, the processing should take a reasonable amount of time. This can be simulated using the Thread.sleep() static method. They shall also be able to be placed on or offline. multiple stations can do the same task. This feature can be used for load-balancing or fail-over purposes. jobs move from station to station via HTTP sockets. The method of transfer is a design decision you can make. jobs originate in initial task stations. Their contents are read in from an input le. You are to design a le format that satisfy the program requirements. job status should be logged. It should be possible to query the status of a particular job (ie what stage of assembly it is in). Job processing failures should be logged as well. A program shall exist that provides a user interface to view this information. It should be able to display the current status (attributes) of any station or job

To Download Click Here > BTP400 Winter 2019: Assignment 1 - (15%).pdf
Codingassignmenthelper | Home Codingassignmenthelper | Home