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 for self- parking 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 parking space. Your implementation should 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. const int N =31; // N parking spaces bool parking[N]; // the garage void EmptyThelot(bool parking[], int N) { for(int i-0; i
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 for self- parking 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 parking space. Your implementation should 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. const int N =31; // N parking spaces bool parking[N]; // the garage void EmptyThelot(bool parking[], int N) { for(int i-0; i
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
c++ coding language
I need help with part B and C please. If you are unable to do both, then
PLEASE prioritize part C. I am really stuck and really can use the help.
This is the code for c that was provided in order to guide me:
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)
{
// ?????
}
main() {
EmptyTheLot(parking, N); // start with an empty parking garage. // get plate numbers and fill lot.
}
![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, O07, 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
parking 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 parking
space. Your implementation should 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.
automate your assignment procedure for self-
const int N =31; // N parking spaces
bool parking[N]; // the garage
void EmptyThelot(bool parking[], int N) {
for(int i-0; į<N; i++) p[i]=false;
}
// empty space
// returns -1 if no space found,
//otherwise it returns 0<=j<N for a valid space.
int EindSpace(int PlateNumber, bool parking[], int N)
{
// ?????
}
main() {
EmetyThelot(parking, N); // start with an empty parking garage. //
get plate numbers and fill lot.
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe8f98c03-2dea-45fe-9e7d-c001811b98bd%2Fa1be67c4-e3ea-45fc-bae7-e46b78231976%2F9lm0ao_processed.png&w=3840&q=75)
Transcribed Image Text: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, O07, 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
parking 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 parking
space. Your implementation should 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.
automate your assignment procedure for self-
const int N =31; // N parking spaces
bool parking[N]; // the garage
void EmptyThelot(bool parking[], int N) {
for(int i-0; į<N; i++) p[i]=false;
}
// empty space
// returns -1 if no space found,
//otherwise it returns 0<=j<N for a valid space.
int EindSpace(int PlateNumber, bool parking[], int N)
{
// ?????
}
main() {
EmetyThelot(parking, N); // start with an empty parking garage. //
get plate numbers and fill lot.
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education