Operating System Msc IT University Of Sargodha (UOS) 2017
Discussion
Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.
No questions yet — be the first to ask.
More Operating System papers
See all
Operating System Msc IT 2 Semester/Term University Of Sargodha (UOS) 2019
Uploaded 3 years ago
Download ↓
Operating System Msc IT 2 Semester/Term University Of Sargodha (UOS) 2018
Uploaded 3 years ago
Download ↓
Operating System MSCS 2015 IUB
Uploaded 3 years ago
Download ↓
Operating System MSCS 2014 IUB
Uploaded 3 years ago
Download ↓
Operating System MSCS 2016 IUB
Uploaded 3 years ago
Download ↓
Operating System MSCS 2016 Mid Term IUB
Uploaded 3 years ago
Download ↓
Paper text
Time Allowel 3:30 Hose
Wabsite at Sarandha
M. 361* TimEon 2003
Taber Chant
(CMP3611)
ustadni.
Objective Part
(Campuleary)
3.
tow to implement hold and wall wa
What is virtual memory?
6.
Write down the name of the different Process State
merokamal and layereil Operatiog system o
Now page fault frequency can be used as a mathod of thrashing
9.
Difference between "progress" and " pounded ime: ln citical section.
üstadni.com
Define the concept of dynamis linking?
What is difference between logical and physical adieus?
10. Page table can be placed either in CPU regietere or main mamoly. What will be the clare to place the
page table in CPU registers?
11. What do you mean by a busy waiting samsphore or apintock?
12. What is API
13. What are the Deadlock Charactertzation?
14. What is Dispatcher?
15. Defina Processor Affinity
16. What are the two typas of Multiprocessing
2ol4es
subjective Part
Note: Attempt any four Queatione. All cairy equal marke
C. No.2 Briefly explala the Deadlock Avoldance algarithmet
Q.No.3
Proces
Arrival
(1244-48)
Bure
10
Peterty
P2
P3.
P4
PS
12 u
What are the average tumaround time and the avarage walting time In
the schedular queue in millianconds for the set of proceeces running
on a system using each of the scheduling algorithme tated below
Q.No.6 A disk with 1000 cylladers, numbers 0 to 099, compute the number of tracks the dies
satisfy all request In the disk queue. Assume the last request serviced was at trail
istaonl.com
move te
hel the head ts moving
towards track
0. The queue in FIFO arder contains request for the following trin
*173, 674, 692, 475, 105,
376. Perform the computation for the following scheduling algorithms
1) FIFO
2) SSTE
3) SCAN
BING:? THIS IS A SOME WE HIMPO REGG POOR 4,
8. R. 1,
1. 3.
Draw diagrams showing the frami
usage at wach memory refere
aigorithmi. Also give the number.
ie faults gener
ed by each alger!
a the fellawing page repincement
im FIFO, LRU, LFU, Assume the system
uses pure demand paging and starts with no pages in real memory. The
visit website: ustadni.com