Assume that the maximum number of employees working in a company is 100 and all employees have personnel numbers (ID) between [1-999999]. Employees' numbers (IDs) will be stored in an array of size 100 . Assume that the ID of a personnel is 15426, then 15426 % 100 = 26 will be calculated and this ID will be assigned to the 26th index of the array. If an ID has already been assigned here, 15426 will be assigned to the 27th index of the array. If 27th index is also full, then an empty space must be searched by increasing the index number and the ID must be assigned when an empty space is found. (If the 99th index is reached when searching empty space, return to the index 0 and continue to search an empty space.) If all elements of the array are full, then the program must print an output indicating that “the array is full". The function that adds records should be given in the form below. This function returns the index number to which the ID is assigned. It must return -2 if the array is full. int Insert(int A[ ], int ID); #define N 100 #define FAIL -2 #define EMPTY -1
Assume that the maximum number of employees working in a company is 100 and all employees have personnel numbers (ID) between [1-999999]. Employees' numbers (IDs) will be stored in an array of size 100 . Assume that the ID of a personnel is 15426, then 15426 % 100 = 26 will be calculated and this ID will be assigned to the 26th index of the array. If an ID has already been assigned here, 15426 will be assigned to the 27th index of the array. If 27th index is also full, then an empty space must be searched by increasing the index number and the ID must be assigned when an empty space is found. (If the 99th index is reached when searching empty space, return to the index 0 and continue to search an empty space.) If all elements of the array are full, then the program must print an output indicating that “the array is full". The function that adds records should be given in the form below. This function returns the index number to which the ID is assigned. It must return -2 if the array is full. int Insert(int A[ ], int ID); #define N 100 #define FAIL -2 #define EMPTY -1
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Assume that the maximum number of employees working in a company is 100 and all
employees have personnel numbers (ID) between [1-999999]. Employees' numbers (IDs)
will be stored in an array of size 100 .
Assume that the ID of a personnel is 15426, then 15426 % 100 = 26 will be calculated
and this ID will be assigned to the 26th index of the array. If an ID has already been
assigned here, 15426 will be assigned to the 27th index of the array. If 27th index is also
full, then an empty space must be searched by increasing the index number and the ID
must be assigned when an empty space is found. (If the 99th index is reached when
searching empty space, return to the index 0 and continue to search an empty space.) If all
elements of the array are full, then the program must print an output indicating that "the
array is full".
The function that adds records should be given in the form below. This function returns
the index number to which the ID is assigned. It must return -2 if the array is full.
int Insert(int A[ ], int ID);
#define N 100
#define FAIL
#define EMPTY
-2
-1
for (i=0; i<N; i++)|
A[i]
EMPTY;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F37569d17-fb16-4ac1-93e1-5ace1aa05029%2Ff342e8b6-d90b-4ac4-b658-d6a47ca326ca%2Fl2iwxb_processed.png&w=3840&q=75)
Transcribed Image Text:Assume that the maximum number of employees working in a company is 100 and all
employees have personnel numbers (ID) between [1-999999]. Employees' numbers (IDs)
will be stored in an array of size 100 .
Assume that the ID of a personnel is 15426, then 15426 % 100 = 26 will be calculated
and this ID will be assigned to the 26th index of the array. If an ID has already been
assigned here, 15426 will be assigned to the 27th index of the array. If 27th index is also
full, then an empty space must be searched by increasing the index number and the ID
must be assigned when an empty space is found. (If the 99th index is reached when
searching empty space, return to the index 0 and continue to search an empty space.) If all
elements of the array are full, then the program must print an output indicating that "the
array is full".
The function that adds records should be given in the form below. This function returns
the index number to which the ID is assigned. It must return -2 if the array is full.
int Insert(int A[ ], int ID);
#define N 100
#define FAIL
#define EMPTY
-2
-1
for (i=0; i<N; i++)|
A[i]
EMPTY;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY