Question

In C++, no code necessary just need to describe

Describe how you would solve such a problem:

When a resident of a small town calls the 911 center , the address must be located from the phone number immediately. This town gets many calls but there are times when there are not enough police forces for each call received. So a queue is formed for getting help. But this queue is based on the importance of the calls. The 911 center must also keep track of the police officer that is assigned to a call. When the police officer is done with its task, it will notify the center. The center also keeps track of the time it took the officer to complete a task. The call center gather the amount of wait time (duration of time -- starting the call received until a police was assigned) and service time (duration of time -- starting at the time the police went to the place to the time the police informed the center for end of service) for each call.

The police department would like to know what time of day we get the shortest wait time and what time of day we have the shortest service time. In general they want to know the sorted values in terms of time. In addition, the police department may for example ask the 911 center who are the last three officers that were assigned to provide service on a given day.

What are the best structures to use by 911 center and what are the best algorithms to run in order to perform the above tasks properly and answer the questions that the police department may have in regards to calls?

Answer 1

Now this is a classical resource allocation algorithm with some variation

Here there are two entities police officers let's say we have (N) i.e limited

now since calls can be a lot and they need to be dealt first come first serve basis

1) Queue of call structure
call structure. will have two fields 1) name or id 2) arrival_time

2) Queue to see the assigned officer i.e officer call structure
officer call structure will have two fields 1) name/id officer 2) dispatch time 3) finish time

3) Array to store the average response time (arrival -dispatch)

4) Arrat to store the average service time (dispatch - finish)


// Algorithm

for every Call create a new call object (with and time(0) ) for start and push in activeCalls queue

check activeOfficer queue size ==0 pick an officer and create an object (id, time, 0) [0 as we don't know finish time]
also calculate time difference when assigning and push to responseTime array

if(activeOfficer.size == N (total officer size) ) do busy waiting

if job is over[i am asuming there is a way for it] calulate serve time = finish -dispatch push in service time array

do as along as jobs are there


last 3 officer is basically get last 3 elements of queue

average time is sum of respective arrays( response and service) by count



Hope it helps do let me know if there is any doubt