Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
6Activity
0 of .
Results for:
No results containing your search query
P. 1
operating System exercises --chapter 5-exr

operating System exercises --chapter 5-exr

Ratings: (0)|Views: 720 |Likes:
Published by evilanubhav
These are some very important solved questions of Operating System book by Galvin
These are some very important solved questions of Operating System book by Galvin

More info:

Published by: evilanubhav on Sep 14, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/09/2014

pdf

text

original

 
 5 
CHAPTER
 CPU Scheduling 
Practice Exercises
5.1
A
CPU
schedulingalgorithmdeterminesanorderfortheexecutionofitsscheduled processes. Given
n
processes to be scheduled on one proces-sor, how many possible different schedules are there? Give a formula interms of
n
.
5.2
Define the difference between preemptive and nonpreemptive schedul-ing.
5.3
Suppose that the following processes arrive for execution at the timesindicated.Each processwillrunthe listedamount of time.Inansweringthe questions, use nonpreemptive scheduling and base all decisions onthe information you have at the time the decision must be made.Process Arrival Time Burst Time
P
1
0.0 8
P
2
0.4 4
P
3
1.0 1a. What is the average turnaround time for these processes with the
FCFS
scheduling algorithm? b. What is the average turnaround time for these processes with the
SJF
scheduling algorithm?c. The
SJF
algorithmissupposedtoimproveperformance,butnoticethatwechosetorunprocess
P
1
attime0becausewedidnotknowthat two shorter processes would arrive soon. Compute what theaverageturnaroundtimewillbeifthe
CPU
isleftidleforthefirst1unit andthen
SJF
schedulingisused.Rememberthat processes
P
1
and
P
2
arewaitingduringthisidletime,sotheirwaitingtimemayincrease. This algorithm could be known as future-knowledgescheduling.
9

Activity (6)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
S.Dharanipathy liked this
Kariyo Denis liked this
Anum Mehmood liked this
Vidhu Vohra liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->