Scribd
Upload
51 views2 pages

VL2018191005671 Da PDF

This document contains 5 questions related to operating system scheduling algorithms: 1. The question asks which scheduling strategy would result in the least CPU utilization for a system with two processes that alternate between CPU bursts and I/O bursts. 2. The question provides the arrival times and burst times for three jobs and asks for the optimal non-preemptive scheduling sequence. 3. The question gives the compute times for three processes and asks for the average turnaround time using the Longest Remaining Time First scheduling algorithm. 4. The question asks to draw Gantt charts and calculate average waiting and turnaround times for different scheduling algorithms. 5. The question asks how many child processes would be created

Uploaded by

Vicky V
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views2 pages

VL2018191005671 Da PDF

This document contains 5 questions related to operating system scheduling algorithms: 1. The question asks which scheduling strategy would result in the least CPU utilization for a system with two processes that alternate between CPU bursts and I/O bursts. 2. The question provides the arrival times and burst times for three jobs and asks for the optimal non-preemptive scheduling sequence. 3. The question gives the compute times for three processes and asks for the average turnaround time using the Longest Remaining Time First scheduling algorithm. 4. The question asks to draw Gantt charts and calculate average waiting and turnaround times for different scheduling algorithms. 5. The question asks how many child processes would be created

Uploaded by

Vicky V
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DIGITAL ASSIGNMENT-I- QUESTIONS FOR CSE2005-OS-F2-SLOT

1. A uni-processor computer system only has two processes, both of which alternate 10 ms
CPU bursts with 90 ms I/O bursts. Both the processes were created at nearly the same time.
The I/O of both processes can proceed in parallel. Which of the following scheduling
strategies will result in the least CPU utilization (over a long period of time) for this system?

(a) First come first served scheduling


(b) Shortest remaining time first scheduling
(c) Static priority scheduling with different priorities for the two processes
(d) Round robin scheduling with a time quantum of 5 ms

What will happen when the following algorithms were approached? (Also justify your
answer)
(i) Round Robin scheduling
(ii) First Come First Served scheduling or Shortest Remaining Time First

2. The sequence …………… is an optimal non-preemptive scheduling sequence for the


following jobs which leaves the CPU idle for ………………… unit(s) of time. Justify your
answer.
-----------------------------------------
Job Arrival_Time Burst_Time
-----------------------------------------
1 0.0 9
2 0.6 5
3 1.0 1
-----------------------------------------

(A) {3,2,1),1 (B) (2,1,3},0 (C) {3,2,1),0 (D) {1,2,3},5

3. Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and
8 time units. All processes arrive at time zero. Consider the longest remaining time first
(LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process
with the lowest process id. The average turnaround time is:
(A) 13 units (B) 14 units (C) 15 units (D) 16 units
Justify your answer with suitable Gantt chat as well as numerical derivations
4. Consider the following set of processes with the length of the CPU burst time in
Milliseconds.

Process Arrival Priority Burst


Time Time
A 0 1 5
B 1 2 3
C 2 1 8
D 3 3 6

(i) Draw four Gantt chart illustrating the execution of these processes using FCFS, preemptive
SJF, Non-preemptive SJT, preemptive Priority non-preemptive Priority (a small priority
number implies a higher priority) and RR (Quantum= 3) scheduling.

(ii) Calculate the average waiting time and average Turnaround time for the above scheduling
algorithms.

5. A process executes the code

fork();
fork();
fork();
fork();

The total number of child processes created is: Justify your answer with suitable code
skeleton
(A) 3
(B) 4
(C) 7
(D) 15



You might also like