Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
spaces, assigr A parking lot 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. parking spaces using 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.

spaces, assigr A parking lot 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. parking spaces using 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.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

c++ programming language.

Part c

I got a respond from you guys and you said it's a writing question but it's not, it a c++ programming question that i need help with please.

 

 

I need help with part c please.

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. }
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Lower bounds sorting algorithm
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS