Car Entry Processing System
Riyadh police is worried about terrorists entering the city through its main gateways on Qassim Road, Makkah Road and AlKharj Road. Since each of these roads is a four lane road, it is hard to stop every car and investigate. They would like to implement a simulation system with creates queues for each lane and a stack for further investigating suspected cars.
They require your help in developing this system with the following details.
Cars arriving from outside the city would be stopped at the entry points. For each of these lanes, your system would take a snapshot of the number plate of the car with a high resolution camera.
We assume that number plates start with a letter (A to D) and 4 digits (0 to 9). Valid license plates are: A0123, B0212, C3312, D3410 etc. Since there are four lanes the cars could arrive on lane 0, 1, 2 or 3.
If a car arrives in lane 0, the system enters its number plate in queue 0. In any of the queues, a car who’s number plate values add to n and n%7==0, are suspected and need to be further investigated (e.g. 1B0700: Lane 1 plate #B0700: 0+7+0+0=7 and 7%7=0 {Warning: Suspect}).
Each car that needs to be further investigated would have to be added to a stack.
For this program you will be writing a Queue, Stack and Node class to contain the data about each number plate. Use the following API to write these classes:
public class Node
String
Node
NumberPlate next
//stores Number plate in the format A0123
//Next reference
boolean
Node()
Suspect()
//appropriate constructors.
You can overload as needed //Returns true/false based on the sum of digits in the number plate
public class Queue
Node int
TOP size
//stores reference to the front node in the queue
//stores size of queue
void Node String
Queue() enqueue(Node) dequeue() toString()
//appropriate constructors. You can overload as needed
//add a Node to the end of the Queue
//removes the node in front of the queue.
//Returns String in the format [A0123, ..
.]
Public class Stack
Node int
TOP size
//stores reference to the front node in the queue
//stores size of queue
void Node String
Stack() push(Node) pop() toString()
//appropriate constructors. You can overload as needed
//add a Node to the top of the Stack
//removes the node from the top of the Stack
//returns String in the format [A0123, ...]
The above classes are similar to the ones written in class with the same functionality for queue enqueuer and dequeuer as well as Stack push and pop. The following shows the Process API.
Public class Process
Stack
Queue
S
Q[4]
//maintains a stack of Nodes (Cars)
//maintains an array of 4 queues.
Queue 0 is for lane
0, 1 for lane 1 and so on.
Void void
Process()
readData(Scanner) Dump()
//appropriate constructor
//Reads data from input stream and process it.
//Writes output to the console.
This class implements two methods, readData and Dump. The constructor method initializes the Stack and Queues array of size 4. The readData reads the input from the console and stores appropriately in the Stack or the Queues.
After the input stream is fully read (-1 is sentinel value), the Dump method is called, which prints the contents of the Stack and all queues.
Input format
0A0001
0B0102
1C1023
2A0122
3D3323
1D1231
1C3123
-1
Input format explanation:
User will enter code for lane number and the number plate of the cars. The first input line 0A0001 indicates the car with plate #A0001 is in lane 0.
It must be entered in Queue0.
Output format
Your program generates the following output.
Lane0:2[0A0001,0B0102]
Lane1:3[1C1023,1D1231,1C3123]
Lane2:1[2A0122]
Lane3:1[3D3323]
Stack:1[1D1231]
Lane0:2 indicate that there are 2 cars in Lane0 and their number plates are [0A0001,0B0102].
Same applies to other queues and the stack. When you call the Dump method, it will dequeue all number plates which are not suspects. The suspected number plates need to be inserted in the stack.
Remember to push in stack after dequeueing appropriate data from the queue(s).
Evaluation:
You are allowed to work in a group of up to 3 students. The score earned would be given to both team members equally.
Your work’s evaluation would be based on Code inspection and successful execution of N number of test cases. The instructor reserves the right to determine the scores of each test case.
Code Inspection:
The code would be inspected by the instructor.
Advanced tools would be used to check for plagiarism cases.
Submission:
Your group needs to submit two files, a Jar file and all code in a zip file. Beware (attach only .java files, .class files cannot be read).
The file names must be your id. For group submission, the filename must be group #
Example:
Group1.jar and group1.zip or
All submissions through LMS (
http://lms.psu.edu.sa)
Note on creating jar files:
Step 0. In Netbeans project, open project properties dialog box by right clicking on the project.
Step 1. Select Run from the options
Step 2. Select the Main Class.
Click browse, a small popup window will list all class containing main method.
Step 3. Select the class you want the jar file to execute first.
Step 4. Click Select Main Class and press OK.
Step 5: Do a clean build of your project.
With default settings, jar file(s) are created in your project folder under dist folder.
Note on verifying jar files.
1. Open terminal window by clicking on start button and typing cmd.
2. Relocate to project folder. If your project is in folder C:>project then type cd \project\dist
3. Type java –jar <jar file>
If you get an error on “main class not found” this means you need to setup paths in your environment.
Follow directions here:
1. On Windows Explorer, right click on “My Computer” or “This PC”
2. Select Properties
3.
Select Advanced System properties
4. In “Advanced Tab” locate button “Environment Variables” and click it.
5. In system variables, select path. Click edit
6. Add the path to your jdk\bin folder 7.
Add a path to your jre\rt.jar file
8. Press ok, and you are done!
Important Notes:
• It is the student’s responsibility to check/test/verify/debug the code before submission.
• It is the student’s responsibility to check/test/verify all submitted work (including jar files)
• It is the student’s responsibility to verify that all files have been uploaded to the LMS.
• For each project, instructor will provide 1-2 sample test-cases to verify the execution of your program.
• After an assignment/project has been graded, re-submission with an intention to improve an assignments scores will not be allowed.
• After the assignment/project has been graded, the instructor will post test-cases used for grading on the website.
• The Instructor has the right to share project execution reports that may have been auto-generated on the course website.
• Plagiarized submissions of projects, assignments and homework’s will be dealt with sternly.
• All code submitted would be checked and compared using advanced plagiarism tools such as hackerrank.
• Any similar code found would result in ZERO earned for all students involved. NO EXCEPTIONS!
Category: IT & Programming
Subcategory: Desktop apps
What is the scope of the project?: Medium-sized change
Is this a project or a position?: Project
I currently have: I have specifications
Required availability: As needed
Required platforms: Windows
