A large parking-systems company would like to automate your assignment procedure forselfparking cars. You have been hired to implement a ”simple” proof-of-concept program in C++, for now customers will enter their 3 digit plate numbers and your software will assign a parking space. Your implementation should a find a free parking space if the original assigned space is occupied. If no spaces are free, your algorithm should say so. You need to encapsulate(embed) your algorithm in a function. You may create as many functions as you need to get the job done. Below is a starting point.
please solve number C
I solved numbers a and b so I do not need number a and b
Problem (taken from page 308 of the textbook)
A parking lot has 31 visitor spaces, numbered from 0 to 30. Visitors are assigned parking spaces using
the hashing function h(k) = k mod 31, where k is the number formed from the first three digits on a
visitor’s license plate.
a) Which spaces are assigned by the hashing function to cars that have these first three digits on
their license plates: 317, 918, 007, 100, 111, 310?
b) Describe a procedure visitors should follow to find a free parking space when the space they are
assigned is occupied.
c) A large parking-systems company would like to automate your assignment procedure forselfparking cars. You have been hired to implement a ”simple” proof-of-concept program in C++, for
now customers will enter their 3 digit plate numbers and your software will assign a parking
space. Your implementation should a find a free parking space if the original assigned space is
occupied. If no spaces are free, your
your algorithm in a function. You may create as many functions as you need to get the job done.
Below is a starting point.
const int N =31; // N parking spaces
bool parking[N]; // the garage
void EmptyTheLot(bool parking[], int N) {
for(int i=0; i<N; i++) p[i]=false; // empty space
}
// returns -1 if no space found,
//otherwise it returns 0<=i<N for a valid space.
int FindSpace(int PlateNumber, bool parking[], int N)
{
// ?????
}
mai
Step by step
Solved in 2 steps with 1 images
