Operating Syste...

Shortest job first scheduling algorithm uses _______ data structure and has ________ time complexity.

The length of seventh CPU burst is 8 ms and its corresponding predicted CPU burst is 6 ms. The smoothening factor is 0.7. What is the predicted value of the eighth CPU burst in milliseconds? (answer up to 1 decimal places)

Which of the following is/are about the Round robin Scheduling Algorithm?

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is pre-emptive shortest remaining-time first. 

Process	Arrival Time	Burst Time
P1	0	11
P2	3	6
P3	7	1
P4	8	3

 

The absolute difference between the average turnaround time and the waiting time and of these processes is_______ milliseconds.

Consider the following set of processes, with the arrival time and the CPU burst time given in milliseconds.

Process Id	Arrival time	Burst time
1	3	2
2	6	1
3	0	3
4	5	X

 

If the average waiting time is 0.75 millisecond for these processes with the shortest job first algorithm then what is the value of X? 

An operating system uses SRTF process scheduling algorithm. Consider the following table for arrival time and execution time.

Process	Arrival Time	CPU burst time
P1	0	8
P2	2	5
P3	3	12
P4	3	10

 

How many context switches are needed excluding the context switches at time zero and at the end?

Let S = {P₁, P2  P3, P4 } be the set of processes arriving at time 0 and the length of CPU burst time given in milliseconds

Process	CPU Burst time (ms)
P1	5
P2	7
P3	6
P4	4

 

Assume that processes being scheduled with Round-Robin Scheduling Algorithm with Time Quantum 4ms and P₁ is having the highest priority while P₄ is having lowest priority. Then the average waiting time is _________ ms. (Answer up to two decimal places)

Consider the following five processes with the length of the CPU burst time given in milliseconds together with their arrival time and priority.

Process	Arrival Time	Burst time	Priority
P1	0	10	4
P2	0	3	1
P3	3	8	2
P4	4	16	3
P5	7	2	5

In priority preemptive scheduling the average waiting time will be (Assume lowest number schedule has highest priority)