This assessment will allow students to demonstrate that they can identify and understand synchronisation and deadlocks.You are working in one company called Beautiful Process Ltd Pty. Your department...

Question 1
i)
ii)
iii)
iv)
v)
vi)
· At t=0, A and B are available, the CPU time of A is less so it will be scheduled.
· At t=4, B will be scheduled and executed but the C has only 1 CPU cycle and it has to wait so B will be stopped after 3 and C will be executed completely.
· At t=9, E will be scheduled and executed.
· At t=13, B and D are available, but B has 5 CPU cycles which will be scheduled.
· At t=18, D will be scheduled.
    Process
    Waiting Time
    Turnaround Time
    A
    4-0 = 0
    13-0 = 13
    B
    0-0 = 0
    8-0 = 8
    C
    8-1 = 7
    9-1 = 8
    D
    16-6 = 10
    27- 6 = 21
    E
    13-6 = 7
    16-6 = 10
vii)
· At t=0, A and B are available.
Response ratio = (W+S) /S
For A, RR = (0+4)/4 = 1
For B, RR = (0+8)/8 = 1
Response ratio for A and B is same but B has high priority hence B will be scheduled first.
· At t = 8, A,C,D,E are available
RR of A = (8+4)/4 = 3
RR of C = (7+1)/1 = 8
RR of D = (2+11)/11 = 13/11 = 1.18
RR of E = (2+3)/3 = 1.66
Hence C is scheduled
· At t = 9, A,D,E are available
RR of A = (9+4)/4 = 13/4 = 3.25
RR od D = (3+11)/11 = 1.27
RR of E = (3+3)/3 = 2
Hence A is scheduled
· At t = 13, D and E are available
RR of D = (7+11)/11 = 1.63
RR of E = (7+3)/3 = 3.3
Hence E gets scheduled
Now at last D will be scheduled
    Process
    Waiting Time
    Turnaround Time
    A
    9-0 = 9
    13-0 = 13
    B
    0-0 = 0
    8-0 = 8
    C
    8-1 = 7
    9-1 = 8
    D
    16-6 = 10
    27- 6 = 21
    E
    13-6 = 7
    16-6 = 10
viii)
· At t=0, A and B are available. B has higher priority, hence B gets scheduled.
· At t = 4, B gets pre completed, A and C are available. A will be scheduled and it be finished at t = 8.
· At t =8, B,C,D,E are available. C gets scheduled and is completed.
· At t=9, B,D,E are available. B gets scheduled and is completed this time.
· At t=13, D and E are available. E has higher priority. E gets scheduled.
· At t=16, Only D is available. D gets scheduled and finished.
    Process
    Waiting Time
    Turnaround Time
    A
    8-4 = 4
    8-0 = 8
    B
    13-8 = 5
    13-0 = 13
    C
    9-1-1 = 7
    9-1 = 8
    D
    26-6-11 = 10
    27- 6 = 21
    E
    16-6-3 = 7
    16-6 = 10
ix)
· At t=0. A and B are available. A needs shortest time, so A gets scheduled.
· At t=4, B and C are available. C has shortest time, So C gets shceduled.
· At t=5, only B is available, so B gets scheduled.
· At t=13, D,E are available. E has shortest remaining time, So E gets scheduled.
· At t=16, Only D is available, hence gets scheduled.
    Process
    Waiting Time
    Turnaround Time
    A
    4-4 = 0
    4-0 = 4
    B
    13-8 = 5
    13-0 = 13
    C
    5-1-1 = 3
    5-1 = 4
    D
    26-6-11 = 10
    27- 6 = 21
    E
    16-6-3 = 7
    16-6 = 10
x)
· At t = 0, A and B are available, A has shortest remainning time, So A gets scheduled.
· At t=0, C arrives and has shortest remaining time, so C gets scheduled.
· At t=2, among A and B, A has shortest remaining time, so A gest scheduled.
· At t=5, B gets scheduled
· At t=6, E has the shortest remaining time hence it gets scheduled.
· At t=9, among B and D, B has the shortest remaining time, so gets scheduled.
· At t=16, D gets scheduled.
    Process
    Waiting Time
    Turnaround Time
    A
    5-4 = 1
    5-0 = 5
    B
    16-8 = 8
    16-0 = 16
    C
    2-1-1 = 0
    2-1 = 1
    D
    27-6-11 = 10
    9- 6 = 3
    E
    9-6-3 = 0
    27-6 = 21
c)
We've already seen how the processes or the scheduling algorithms can be used for the process to be executed in the system. We tried 5 different algorithms for the execution of the processes in a proper manner. Each of the algorithm has been used to draw a gantt chart and then calculate waiting time and turn around time. For each of the algorithm I tried to implement the gantt chart and then each of the step is explained in detail. Each algorithm has their waiting time and turn around time for the processes in the system.
It is not a easy task to select one of the algorithm which performs the best out of these. As per the chart under table we can see that there are multiple algorithms which are behaving properly and can be used by the organization as their scheduling algorithm. If you talk about the first algorithm which is the feedback queue scheduling algorithm then...