Given a set of processes and burst time draw the gantt chart using scheduler Round Robin  Time Quantum= 4 milliseconds   Process Burst Time                                       P1 24                                       P2 4                                       P3 4

1) Given an O/S with soft timers using a single clock, consider a situation where the event list looks like this:   Current time = 4105; Next Signal = 6; Clk Header → 6 → 1 → 3 → 12 → 5 a. What will current time be when the “12” signal is dispatched =  b. At time 4113 a new signal arrives to be scheduled for 4125, fill in the following to reflect this signal being added at that time:        Current time = ; Next Signal = ; Clk Header → 2)  Given a disk with 100 tracks, Consider the following disk request sequence (track numbers): 45, 20, 90, 10, 50, 60, 80, 25, 70. The initial position of the R/W head is on track 50. Determine the distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used and the Elevator algorithm (note -the Elevator algorithm will move towards 100 when it starts execution).  Which algorithm will move the fewest tracks , SSTF or Elevator: , and by how many fewer tracks: tracks less than the other algorithm.

Consider the below interrupts and their priority settings of user and natural interrupt priorities. a. Ext_interrupt_1: User Priority = 1, Interrupt Vector = 30; b. Ext_interrupt_2: User Priority = 0, Interrupt Vector = 45; c. Ext_interrupt_3: User Priority = 1, Interrupt Vector = 90; d. Ext_interrupt_4: User Priority = 1, Interrupt Vector = 95; If the above interrupts occur at the same time, which one will be served first? a b.

Suppose that we have the table below that includes four processes with their Arrival times and Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPU scheduling. Answer the following questions: Process Arrival CPU-burst ID time time P1 0 1 P2 3 3 P3 2 4 P4 4 3 Completion Time Response Turn Around Time Time Waiting Time a. Draw the Gantt chart. b. Complete the above table. c. Calculate the average waiting time.

Given the following processes and needed burst time for each one Process Burst Time Arrival time P1 13 1 P2 8 Using Round Robin scheduling (with a quantum of 5), the waiting times of each process are: P1 = %3D P2 =