There are four people visited the flour mill to make wheat powder. Depending on the wheat quantity, they need burst time to make wheat powder. The customer arrival time and burst time are recorded by the flour mill owner. The owner will permit the customers based on their arrival time and minimum burst time. Based on the given table below, the person who arrived first will get a chance to enter into the flour mill until the second person arrived. If the second person arrived, the mill owner will compare the burst time of the first and the second person. The person with the smallest burst time will get the chance to enter to the mill and the other person will wait. This process is going on until all four people completed/finished the work. Select a suitable scheduling algorithm to draw the Gantt chart and calculate the waiting and the Average waiting time. (5 marks)
People Name
Arrival Time
Burst Time
P1
0
5
P2
1
3
P3
2
4
P4
3
2
There are three (3) children who wants to take biscuits from their father. The Father assured that he will give only 2 biscuits per time. The table 1 shows the number of biscuits each child expecting to get from their father. Find a suitable scheduling algorithm for the above scenario and draw the Gantt chart, calculate waiting time and average waiting time. (3 marks)
Child’s Name
Number of Biscuits Expected
P1
4
P2
3
P3
5