0% found this document useful (0 votes)
64 views4 pages

Cs 405 Operating System Jun 2020

Uploaded by

prvt acnt
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
0% found this document useful (0 votes)
64 views4 pages

Cs 405 Operating System Jun 2020

Uploaded by

prvt acnt
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/ 4

https://www.rgpvonline.

com

Total No. of Questions : 8] [1] [Total No. of Printed Pages : 4


Roll No ..................................
CS-405-CBGS
B.Tech., IV Semester
Examination, June 2020
Choice Based Grading System (CBGS)
Operating System
Time : Three Hours
Maximum Marks : 70
Note: i) Attempt any five questions.
{H$Ýht nm±M àíZm| H$mo hb H$s{OE&
ii) All questions carry equal marks.
g^r àíZm| Ho$ g_mZ A§H$ h¢&
iii) In case of any doubt or dispute the English version
question should be treated as final.
{H$gr ^r àH$ma Ho$ g§Xho AWdm {ddmX H$s pñW{V ‘| A§JO
o« r ^mfm
Ho$ àíZ H$mo A§{V‘ ‘mZm Om¶oJm&

1. a) Define Process States. Draw the diagram of PCB. 7


Process States n[a^m{fV H$a|& PCB H$m aoIm{MÌ ~ZmBE&
b) What is meant by a System call? How it can be used? How
does an application program use these calls during
execution? 7
System call go ³¶m ‘Vb~ h¡? BgH$m Cn¶moJ H¡$go {H$¶m Om
gH$Vm h¡& EH$ application (EpßbHo$eZ) àmoJ«m‘ execution Ho$
Xm¡amZ BZ call H$m Cn¶moJ H¡$go H$aVm h¡?

2. a) Write a short notes (Any two) 7


g§{já ZmoQ> {bI§o& (H$moB© Xmo)
i) Time sharing
ii) Network
iii) Batch processing

CS-405-CBGS PTO
PTO

https://www.rgpvonline.com
https://www.rgpvonline.com

[2]

b) Describe various space allocation strategies with their


merits/demerits. 7
CZH$s ¶mo½¶Vm Am¡a AdJwUm§o Ho$ gmW {d{^Þ space allocation
strategies H$mo g‘PmBE&
3. a) Consider the following set of processes. 7
Process Burst time Arrival time
P1 3 0
P2 5 1
P3 2 2
P4 5 3
P5 5 4
Develop a Gantt-chart and calculate the average waiting
time using:
i) FCFS
ii) SJF
iii) Round Robin (q = 1)
Set of processes H$mo ܶmZ ‘§o aIVo hþE&
Process Burst time Arrival time
P1 3 0
P2 5 1
P3 2 2
P4 5 3
P5 5 4
ZrMo {XE JE Algorithms H$m à¶moJ H$aHo$ Gantt-chart {dH${gV
H$ao Am¡a average waiting time H$s JUZm H$a|&
i) FCFS
ii) SJF
iii) Round Robin (q = 1)
b) Briefly explain the following. 7
{ZåZ{b{IV H$mo g§{já ‘| g‘PmBE&
i) Mutual exclusion
ii) Critical section problem
CS-405-CBGS Contd...
PTO

https://www.rgpvonline.com
https://www.rgpvonline.com

[3]

4. a) Compare Paging and Segmentation with example. 7


CXmhaU Ho$ gmW Paging Am¡a Segmentation ‘| A§Va H$s{OE&
b) What is meant by Thrashing? Explain various causes of
thrashing. 7
Thrashing go ³¶m ‘Vb~ h¡? Thrashing Ho$ {d{^Þ H$maUm| H$mo
g‘PmBE&
5. a) Consider the main memory with capacity of 3 frames.
Assume that pages of a process are referenced in the order
as given below:
7, 0, 1, 2, 0, 3, 0, 4 , 2, 3, 0, 3
Which one is better FIFO or LRU and why? 7
3 frames H$s j‘Vm (capacity) Ho$ gmW main memory na {dMma
H$a|& ‘mZ b| {H$ ZrMo {XE J¶o H«$‘ Ho$ g§X^© (referenced) ‘| h¡,
Page of process
7, 0, 1, 2, 0, 3, 0, 4 , 2, 3, 0, 3
FIFO ¶m LRU ‘| go H$m¡Z ~ohVa h¡, Am¡a ³¶m|?
b) Explain the concept of dirty bit for improving the
performance during page fault. 7
Page fault Ho$ Xm¡amZ àXe©Z ‘| gwYma Ho$ {bE dirty bit H$s AmdYmaUm
H$mo g‘PmBE&
6. a) What is Virtual Memory? Explain the concept of demand
paging. 7
Virtual Memory ³¶m h¡? Demand paging Ho$ concept H$mo
g‘PmBE&
b) Explain how logical memory address are translated into
physical memory address in segmented memory
management system with example. 7
Segmented memory management system ‘| logical
memory address, physical memory address ‘| H¡$go n[ad{V©V
{H$¶m OmVm h¡, CXmhaU Ho$ gmW g‘PmBE&
CS-405-CBGS PTO
PTO

https://www.rgpvonline.com
https://www.rgpvonline.com

[4]

7. a) Consider following Snapshot of a system: 7


Allocation Max Available
ABC ABC ABC
P0 101 431 330
P1 112 214
P2 103 133
P3 200 541
Answer the following questions using Bankers Algorithm
i) Is the system in Safe state
ii) What is the content of the Matrix need?
System Ho$ Snapshot no {dMma H$a|:
Allocation Max Available
ABC ABC ABC
P0 101 431 330
P1 112 214
P2 103 133
P3 200 541
Bankers Algorithm H$m à¶moJ H$aHo$ {ZåZ{b{IV H$m CÎma Xr{OE&
i) ³¶m system Safe state ‘| h¡?
ii) ‘¡{Q´>³g H$s gm‘J«r (content) ³¶m h¢?
b) What do you mean by Semaphore? Explain its uses and
its implementation. 7
Semaphore go ³¶m ‘Vb~ h¡ ? BgHo $ Cn¶mo J Am¡ a
implementation H$mo g‘PmBE&

8. Write short notes. 14


g§{já ZmoQ> {bI|&
a) Remote Procedure Call (RPC)
b) Worms and Virus
c) Define levels of RAIO

******
CS-405-CBGS PTO

https://www.rgpvonline.com

You might also like