Overview For this assignment, we will practice using stacks and queues. In this exercise, you will...

Question

Question

Overview For this assignment, we will practice using stacks and queues. In this exercise, you will...

Overview

For this assignment, we will practice using stacks and queues. In this exercise, you will create two stacks and a queue to keep track of cars using a parking lot. We will use the nature of the stacks and queues to solve the problem.

Specifications

Rules

FIU has opened a new valet parking lot next to the PC building that requires a special decal to park. If the car does not have the correct parking decal, the driver should be told nicely that they do not have the correct permit to park in this lot.

The parking lot is a “last-in, first-out” stack. When parking a car, the program must first check to see if the car has the correct decal. If it does have the correct permit, the car may be added to the lot as long as there is enough room. To park a car, the car’s license tag is added to the parking lot stack. The parking lot can hold 20 cars at a time. If the parking lot is full, a waiting car can be added to a waiting queue. When a car leaves the lot, the next car in the queue will be able to park in the parking lot. When a car owner retrieves a vehicle that wasn’t the last one in, the cars blocking it must temporarily move to the street so that the requested vehicle can leave.

Write a program that models this behavior, using one stack for the driveway and one stack for the street. A queue will be used to store the cars waiting for a place to park of the lot is full

Use integers as license plate numbers. Positive numbers add a car, negative numbers remove a car, zero stops the simulation. If the stack representing the parking lot is full, the car waiting should be added to the queue. Print out the parking lot stack and the waiting queue after each operation is complete.

Expected Output:

The expected output should contain the list of cars currently parked in the parking lot and the list of cars currently waiting to park.

Java Requirements

The program must

Utilize a stack representing the parking lot.
Utilize a stack representing the street.
Utilize a queue to store the cars waiting to park.
Check the parking decal type and politely tell the driver if they do not have the correct decal.
Limit the number of cars parking in the lot to a maximum of 20.
Output that includes the cars parked in the lot and any cars waiting in the queue to park after each operation.
Have an easy to understand user interface that allows the user to park a car or retrieve a parked car.

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

Here is the code in java please do upvote thankyou..!!

Also attached the screenshots of the output..

//code

package valetParking;
import java.util.*;

// class Valet Parking
public class ValetParking {

   // stacks and queue
   Stack<Integer> parkingLot = new Stack<Integer>();
   Stack<Integer> street = new Stack<Integer>();
   Queue<Integer> waiting = new LinkedList<Integer>();

   // function to add the car into the parking
   public void add(int x)
   {
       // if parking stack is full
       // then add it into the waiting park
       if(parkingLot.size() >= 20)
       {
           waiting.add(x);
       }
       // if parking stack is not full
       else
       {
           parkingLot.push(x);
       }
       // print everything
       System.out.print("Parking Lot: ");
       ValetParking.printStack(parkingLot);
       System.out.println("\nWaiting car: "+ waiting );


   }

   // function to print stack using recursion
   public static void printStack(Stack<Integer> s){
       if(s.empty()){
           return;
       }
       int x = s.pop();
       System.out.print(x + " ");
       printStack(s) ;
       s.push(x);
   }

   // remove car from parking
   public void remove(int x)
   {
       // if parking is not empty
       if(!parkingLot.empty())
       {
           // excess all element and search till same number
           // or to the end of stack
           // push all the elemnt of parking stack into street
           int n = parkingLot.pop();
           while(n != -x)
           {
               street.push(n);
               if(parkingLot.empty())
                   break;
               n = parkingLot.pop();
           }

           // push back element from street to parking
           while(!street.empty())
               parkingLot.push(street.pop());

           // check is there any space for waiting cars
           if(waiting.size()!=0 && parkingLot.size() <20)
               parkingLot.push(waiting.poll());
       }

       System.out.print("Parking Lot: ");
       ValetParking.printStack(parkingLot);
       System.out.println("\nWaiting car: "+ waiting );

   }


   // driver function
   public static void main(String[] args)
   {
       // object creation
       ValetParking vp = new ValetParking();

       Scanner sc = new Scanner(System.in);

       int x = sc.nextInt();

       while(x != 0)
       {
           if( x > 0)
               vp.add(x);
           else
               vp.remove(x);

           x = sc.nextInt();
       }


   }

}

--OUTPUT--

input 1 Parking Lot: 1 Waiting car: [] 2 Parking Lot: 2 1 Waiting car: [] 3 Parking Lot: 3 2 1 Waiting car: [] 4 Parking Lot: Parking Lot: 11 10 9 8 7 6 5 4 3 Waiting car: [] L2 Parking Lot: 12 11 10 9 8 7 6 5 4 3 2 1 Taiting car: [] 13 Parking Lot: 1 Parking Lot: 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 Waiting car: [] 20 Parking Lot: 20 19 18 17 16 15 14 13 12 11 10

Add a comment

Answer 2

Overview For this assignment, we will practice using stacks and queues. In this exercise, you will...

Homework Answers

Add Answer to:
Overview For this assignment, we will practice using stacks and queues. In this exercise, you will...

Post as a guest

Earn Coins