Write a C++ program to manage a parking lot. Build Specifications 1. The parking
ID: 3777715 • Letter: W
Question
Write a C++ program to manage a parking lot.
Build Specifications 1. The parking lot has multiple levels. Each level has multiple rows of spots.
2. The parking lot can park motorcycles, cars, and buses.
3. The parking lot has motorcycle spots, compact spots, and large spots.
4. A motorcycle can park in any spot.
5. A car can park in either a single compact spot or a single large spot
6. A bus can park in five large spots that are consecutive and within the same row. It cannot park in small spots.
Function description (70 point): 1. Setup the parking lot. You should be able to create a customizable parking lot.
2. Edit the parking lot layout: You should be able to change the parking lot layout. For example: Add levels, change the spot layout at a level, etc.
3. Reserve: You need to be able to reserve a spot. The user should provide the level number, the row number, and then the spot number.
4. Search: See how many free spots on a specific level.
5. Get Free spots: How to get how many free spots of each kind in the whole parking lot.
Also, design a menu (should still appear until the exit option is chosen) in the Main program that has the following options implemented to test your classes’ functionality (30 points): 1. Setup the parking lot 2. Edit 3. Look for capacity 4. View level information 5. Exit
EDIT: Please don't send a link to another chegg question similar to this.
Thanks!
Explanation / Answer
public enum VehicleSize
{
Motorcycle, Compact, Large,
}
public abstract class Vehicle{
protected ArrayList<ParkingSpot> parkingSpots = new ArrayList<ParkingSpot>();
protected String licensePlate;
protected int spotsNeeded;
protected VehicleSize size;
public int getSpotsNeeded()
{
return spotsNeeded;
}
public VehicleSize getSize()
{
return size;
}
public void parkInSpot(parkingSpot s)
{
parkingSpots.add(s);
}
public void clearSpots()
{
for (int i = 0; i < parkingSpots.size(); i++)
{
parkingSpots.get(i).removeVehicle();
}
parkingSpots.clear();
}
public abstract boolean canFitInSpot(ParkingSpot spot);
}
public class Bus extends Vehicle
{
public Bus()
{
spotsNeeded = 5;
size = VehicleSize.Large;
}
public boolean canFitInSpot(ParkingSpot spot){
return spot.getSize() == VehicleSize.Large;
}
}
public class Car extends Vehicle{
public Car()
{
spotsNeeded = 1;
size = VehicleSize.Compact;
}
public boolean canFitInSpot(parkingSpot spot){
return spot.getSize() == VehicleSize.Large || spot.getSize() == VehicleSize.Compact;
}
}
public class Motorcycle extends Vehicle{
public Motorcycle()
{
spotsNeeded = 1;
size = VehicleSize.Motorcycle;
}
public boolean canFitInSpot(parkingSpot spot)
{
return spot.getSize() == VehicleSize.Large || spot.getSize() == VehicleSize.Compact || spot.getSize() == VehicleSize.Motorcycle;
}
}
public class ParkingLot
{
private Level[] levels;
private final int NUM_LEVELS = 5;
public ParkingLot()
{
levels = new Level[NUM_LEVELS];
for (int i = 0; i < NUM_LEVELS; i++){
levels[i] = new Level(i, 30);
}
}
public boolean parkVehicle(Vehicle vehicle)
{
for (int i = 0; i < levels.length; i++)
{
if (levels[i].parkVehicle(vehicle))
return true;
}
return false;
}
}
public class Level
{
private int floor;
private ParkingSpot[] spots;
private int availableSpots = 0;
private static final int SPOT_PER_ROW = 10;
public Level(int flr, int numberSpots)
{
floor = flr;
availableSpots = numberSpots;
spots = new ParkingSpot[numberSpots];
int largeSpots = numberSpots / 4;
int bikeSpots = numberSpots / 4;
int compactSpots = numberSpots - largeSpots - bikeSpots;
for (int i = 0; i < numberSpots; i++)
{
VehicleSize sz = VehicleSize.Motorcycle;
if (i < largeSpots)
{
sz = VehicleSize.Large;
}
else if (i < largeSpots + compactSpots)
{
sz = VehicleSize.Compact;
}
int row = i / SPOT_PER_ROW;
spots[i] = new ParkingSpot(this, row, i, sz);
}
}
public int availableSpots()
{
return availableSpots;
}
public boolean parkVehicle(Vehicle vehicle)
{
if (availableSpots() < vehicle.getSpotsNeeded())
return false;
int spotNumber = findAvailableSpots(vehicle);
if (spotNumber < 0)
return false;
return parkStartingAtSpot(spotNumber, vehicle);
}
private boolean parkStartingAtSpot(int num, Vehicle v)
{
vehicle.clearSpots();
boolean success = true;
for (int i = num; i < num + vehicle.spotsNeeded; i++)
{
success &= spots[i].park(vehicle);
}
availableSpots -= vehicle.spotsNeeded;
return success;
}
private int findAvailableSpots(Vehicle vehicle)
{
int spotsNeeded = vehicle.getSpotsNeeded();
int lastRow = -1;
int spotsFound = 0;
for (int i = 0; i < spots.length; i++)
{
ParkingSpot spot = spots[i];
if (lastRow != spots.getRow())
{
spotsFound = 0;
lastRow = spots.getRow();
}
if (spots.canFitVehicle(vehicle))
{
spotsFound++;
}
Else
{
spotsFound = 0;
}
if (spotsFound == spotsNeeded)
{
return i - (spotsNeeded - 1);
}
}
return -1;
}
public void spotFreed()
{
availableSpots++;
}
}
public class ParkingSpot
{
private Vehicle vehicle;
private VehicleSize spotSize;
private int row;
private int spotNumber;
private Level level;
public ParkingSpot(Level lvl, int r, int n, VehicleSize s)
{
level = lvl;
row = r;
spotNumber = n;
spotSize = s;
}
public boolean isAvailable()
{
return vehicle == null;
}
public boolean canFitVehicle(Vehicle vehicle)
{
return isAvailable() && vehicle.canFitInSpot(this);
}
public boolean park(Vehicle v)
{
if (!canFitVehicle(v))
return false;
vehicle = v;
vehicle.parkInSpot(this);
return true;
}
public int getRow()
{
return row;
}
public int getSpotNumber()
{
return spotNumber;
}
public VehicleSize getSize()
{
return spotSize;
}
public void removeVehicle()
{
level.spotFreed();
vehicle = null;
}
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.