Scribd
Upload
2 views2 pages

Tutorial 2

The document contains a tutorial for an Operating Systems course with a focus on scheduling algorithms, specifically FCFS and SJF. It includes various questions that require calculations of average waiting time, turnaround time, CPU idle time, and comparisons between scheduling methods. Additionally, it poses multiple-choice questions regarding the properties and effects of different scheduling algorithms.

Uploaded by

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

Tutorial 2

The document contains a tutorial for an Operating Systems course with a focus on scheduling algorithms, specifically FCFS and SJF. It includes various questions that require calculations of average waiting time, turnaround time, CPU idle time, and comparisons between scheduling methods. Additionally, it poses multiple-choice questions regarding the properties and effects of different scheduling algorithms.

Uploaded by

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

Tutorial 2

Operating Systems Course (CS111)

Q1. Three processes arrive at times 0, 1, and 2 respectively. Their CPU burst
times are 5, 3, and 8 units respectively. They are scheduled using FCFS.
Calculate Average waiting and TAT time.
Q2. Four processes arrive at the same time and are scheduled using FCFS.
Burst times: P1=12, P2=6, P3=2, P4=8 Calculate avg. waiting time of P4 is
and Scheduling Length.

Q3. Processes scheduled using FCFS: P1(AT=0,BT=4), P2(AT=3,BT=3),


P3(AT=5,BT=2) Calculate CPU idle time.

Q4. A CPU schedules 5 processes using FCFS with burst times in increasing
order. Which is TRUE?

A. FCFS gives minimum average waiting time


B. FCFS avoids convoy effect
C. FCFS produces maximum average waiting time
D. FCFS is equivalent to SJF in this case

Q5. All processes arrive at time 0. Burst times: 7, 2, 5, 3 apply FCFS and
SJF and compare average waiting time, also calculate the throughput and
SL.
Q6. Processes scheduled using non-preemptive SJF: P1 (AT=0, BT=6), P2
(AT=1, BT=2), P3 (AT=2, BT=4)
Calculate the flowing:

 CT
 TAT
 WT
 Avg. WT
 Avg. TAT
 Scheduling length
 Throughput

Q7. Minimum possible average waiting time is achieved by:

A. FCFS B. SRTF C. SJF D. Not Listed

Q8. Four processes with burst times 1, 3, 6, and 8 are scheduled using SJF.

Turnaround time of last process is:

A. 10 B. 14 C. 18 D. 20

Q9. Which scheduling algorithm can cause starvation?

A. FCFS B. SJF C. Round Robin D. FCFS and RR

Q10. Average waiting time using FCFS is 10 units and using SJF is 6 units.

Percentage reduction is:

A. 30% B. 40% C. 50% D. 60%

You might also like