USN 11 Is _I I I I I!

I I I I I 1®
f/j S1ddagan~!~~'!!!~:1..e!.°~!~~~~-==-L572103 3RIS04
Thir dSe me~ ter B.E. Info rma tion ·scie nce
I &Engg. ExamlnatlonsMar.2021
Time: 3 Hours 1
I ·op era ting Systems
~
Note : j Answ er any five questions choo sing Max. Marks: 100
one full question from each unit.
i
i Uni t-I
1 a) Define an operating Jystem. Discuss its role
with user and system vie~ points.·
!
b) What are the activiti~s for which the operating
I DL: 11 I CO: I • I P01 11
06
system is responsible for in connection with:
(i) Process managem~nt (ii) File managem
ent
. ; ~,-DL-:~1-,--•,-lc_o_:'l-,-,1-Po-1'1-,--.---r--~ 10
c) List different service~ of operating system.

I DL: 11 I CO: 11
04

2 a) What are OR
system call~? With examples explain different categories of system calls.'·
: ;_ 10
· I DL: · I I I·CO: I I I PO~ I 1 1·
b) Explain the layered -~pproach fo~ -structuring
an operating system. List the merits and demerits of
the same. ;
'
10
I DL: 11 I CO: 1, I PO:\ I '
Uni t-II
3 a) What is a process? Draw and explain the
process state diagram. ''
I .-Ie-L-,..,..I- ,____:=-,l_c_o:----r-12-----r-lP-o+:\ ,-1- ,- - . - - 06
------,------,
b) Differentiate betwee~ long term and short term
schedulers.
;
,-2--,lr-c_o_:.,...,-2-.,... ,-Po-,' I-:---,_-.- -r -- -,
,_Ie-L-:..... 04
c) Suppose four proceskes arrive for processin
g in the. order Pl, P2, P3, P4 with burst times and
priorities as given below:
·
Process Pl P2 P3 P4
: Burst time 7 4 3 5
Priority 3 4 2 1
Draw the Gantt charts and calculate the average
waiting ti~e for the :ollowing algorithms:
(i) First come First served (ii) Shortest job first
(iii) Prionty scheduling 10
I DL: I 3 I I CO: 2 I IPO: 2

OR
4 a) What is Inter process commum.cat1.0n? Exp lain the methods used for the same. 10
[ BL: 11 co: 3 Po: 11 I I I
.
b) Discuss van ous mu1ti'threa d'mg models with diagram. 06
[sL:
11
Ico: 12 I PO: \ 1
c) How does infonnation related to a process is
.
.r::: . t .
a,~e
d by an operating syst~m? Illustrate.
I 1, I 1, I I
co, ,o, ]
04·

Please Turn Over

-1-
 -2-

U ni t-I II 3~
S a) State the dining philosophers problem and giv
e a solution for the same, us
1 the structure of philosopher 1. ~g semaphores. Write
I DL: 1 2
:
b) Define hardware instru
ctions test-and-setO and
I C?1 I 3 I PO: : 12 I 1------,
I

algorithms for implementing

mutual exclusion with these
co mp are -and-swapQ. ;And also
instructions. .
giv~
c) Explain the three requirem DL: . I I
2. . C0 1. P0: : 12 I I) I I I =:J
ents that a solution to the cn I
tlcal section problem'must sat
isfy.
DL: I t I I CO: PO: '. I t I I) I I :J (
OR .
6 a) Consider the following
snapshot of a system
Allocation Max Available
A B C A B C A B
C
Po 0 0 2 0 0 4 1 0 2
'i P1 1 0 0 2 0 1
I
i
P2 1 3 5 1 3 7
i: P3 6 3 2 8 4 2
: P4 1 4 3 1 5 7
(i) Find the ~eed matrix and cal
culate safe sequence using ba
(ii) Mention whether the above sys nkers ~lgorithm.
tem is safe or not safe.
r--1B-L:-ilr-3- ..., -CO-:-.-1-3-- -,1-Po---
-=:;--.-1-2-, .- -:-- -. 1~ -1 10
b) What are the necessary
conditions for a deadlock?
Explain different met?ods to
deadlock. recover from
·. I I ,
I I
BL: t CO: 3 I \j
PO: 2 I I 10

Un it- IV
7 a) What is paging and sy.rappin
g? With a diagram, discuss the
steps involved ~ handling pa
DL: . · .•I
\ co :· I ge fault.
I I I 08
b) What is meant by address 2
binding? Explain with the ne
4 Po: \ 2 \ I I
and data to memory ~ddresse cessary steps, the b{nding of
s. instructions
. .
I BL: I t
08
c) Distinguish between intern I CO : I 4 I PO:l 1 2
al fragmentation and externa
l fragmentation.
:
: ---.-,----.-.:..-1
B-L 04
\ ,--
: ---.-1-"" ""TI-PO...;...:1 -.,.....,---.,-
-i
~-0
,·
..
- ,1
...
OR
8 a) Illustrate the wo
rking!of segmentation memo l

ry management scheme with

: IBL: I
n¢cessary hardware.
I I
06
b) Describe the different; acc
ess methods on files.
t CO: 4 IPO: ! 1 I I 2
J
~ l 08
.c) Illustrate the working ;of II IBL:
CO: I I 4 I iI
PO: t J
inverted paging with a neat i
diagram. i 06
I DL: j t Ico: I 4 Iro: j I 2
J

Continuea..,
 ..,
i
i
I;
! -3- . 3RIS.04 .
!i
Unit-V
9 a) Given the page refer~nce string
! 0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3
Three frames are all9cated for the program in the main memory. Determine the number of page
faults using_ (i) LRU policy (ii) Optimal replacement policy
. j ~ln_L_:_1~3-~lc_o_:~j-s-~I-Po-:~l-2--.----.-- 7
10
b) Explain real time sc~eduling algorithms employed ·by Linux Operating System.
06
l I BL: I1 I CO: I 511 I PO:

c) What is meant by a c~py on write? Where is it....:u=s:.:.ed:_:?~E=x~p:.:la~in::.::in~b:,::n.:.:·e..:.f·-r--=-7"""'.:---r-,--,

04
DL: 11 I CO: 5I I
PO: \ 1 I
OR
a) Explain the·process rtianagement model of Lin~u~x~op~er~a~ti~ng~SY:.:_S:,::te:;:m::·~-.---:~---;---,--,-
1 I 10
10 ; BL: \ 1 CO: I 5 I I
POi \ 1 7
b) What is the need for page replacement? Descri~b'.:e.::_w~it~h~a~n~e~at~d:_i~agr~am:::.:_.-.:-::- '-r:--,- ,-
10
.; I DL: \ 2 \ CO: \ 5 \ PO:~ \ 1 7
 ~ [@I I I I 11 I I I I 1@-==1 3RCS05
~s , Siddagan~!.~~'~!~M?!.!~~~,~~~~,!:.T,~~~!!!~,u - 572103
ThlrdSemest~r B.IT' Computer Science & EnglneerlngMakeup ExamlnatlonsJuly2021
•i Operating Systems
Max. Marks: 100
. . 3 Hours
11rt18· Note iAnswer any five questions choosing one full question from each unit.
Unit- I
Describe the essential properties of following types of OS.
1 o)
i) Multiprogra~ming. ii) Time sharing.
- L:- -,-/-2
,. -D --.,-C-0:--r-lI- -..-, ,
P-0 ~:, ...... I-----.--,-PS-
0: ...... ,-1---, 6

b) What are system calls? Explain how system calls are managed by OS with neat diagram. 6
: DL: 2 ICO: j I I
PO: : / 1 PSO:I I I / 1

c) What are the benefit~ of micro 'kemel approach to system design? Compate this approach with
the layered approach; 1 8
I DL: 1 2 I CO: 11 I I PO: [ I rso: I '
OR / .
z a) Why it is necessary to have 2 modes of operation? Explain the modes along with the advantages
of dual mode of operation. : .' 6
I DL: I2 I CO: 11 I I PO: i I I PSO: I'
b) Describe any three system calls each for process control and file management. 6
.I DL: I 2 I CO: I ' .I PO: : / 1 I _PSO: , ,

c) What is the advantages of designing an OS us.ing hybrid structure? Explain,the structure of Mac
OSX with a block di~gram. · · ' 8
I BL: I 2 I CO: I' I I PO: : I I PSO: I•
Unit- II
and program. Explain the process control bloc~ structure in detail. 6
3 a) Differentiate between process
I BL: I 4 I CO: I • I 'I • PO: I PSO: I I

.b) An OS uses Shortest Remaining Time First'(SRT) process scheduling algorithm. Consider the
arrival time and execution times for the following processes:
Process P, P2 P3 P4
Burst time 20 25 10 15
ij Arrival time 0 15 30 45
i) Draw Gantt chart illustrating the execution of these processes with preemptive and
l

non- preemptive SJF

I
scheduling algorithm.
ii) Compute turn around time and waiting time for each process in each of the scheduling
l
algorithm and finp average waiting time and average turn around time. 8
I I BL: I 3 I CO: I 3 I I PO: 2 I PSO: I I

c) Explain the benefits 9fmultithreaded programming. Explain ~o types of p·ara'ilelism in brief. 6

I BL: , .2 I CO: I• I I PO: I I PSO: , ,

: OR
4 a) Differentiate betwe~n preemptive scheduling and non-preemptive scheduling. Explain the
functionalities of dispatcher. 6
I DL: , ◄ I CO: 13 I PO: j 2 I PSO: 11

-1 - Please Turn Over

 -2- 3Rcs
b) Consider the following set of processes
,--..:..__ _..:,._p-,.-r·-;:;p
.,.- P3·, P7,
1-,:P:..:r:.!:o.::,:ce::!:ss~-1---7-:~'-;;;~
\I Bursttime IO 1~ ' ~-=2:......+-3::-1
, Arrival time O-'--ifon of these processes using Round Robin
i) Draw the qantt chart illustrating the exe~~ oms.
scheduling algorithm with time quantur? 0 -'"or each process using RR algorithm.
1·1·) C '
ompute turnaround time an d wai'ting ume. . i• tjme? . .
·1·1·) . Wh .
1 : . .,,..,
at 1s the ,effect ofttme quan~...... ~on wa1t1~g . . I I
I co: J ,o, I 2 I rso, j I J 6
3
; · . !PC models with neat diagrams.
c) Explain the shared memory and message passc&::-1 2 / co: / 2 I ro: I 2 I rso, j I J 8

, Unit-III
· . that a solution to critical section problem must
, .st th reqmrements :
5 a) Define race conditipn. Li e :
6
satisfy. : ~L: I 2 I co: I s I ro:! I 2 I rso: 1, J
: . h Dining philosophers problem \ising semaphore.
. . olut1on to t e 6
b) What are semaphores? Give a s [!L: 2 co: j s I PO: ;. j 2 j rso: j I
I I J
f ystem·
c) Consider the fiollowing snapshot o a s Max Available
Allocation
B C D A B c, D
Process A B C D A
Pq 0 0 I 2 0 0 I
0
0 I 5 2/ 0
0 0 I 7 5
Pr I 0 5 6
5 4 2 3 i
P2 1
0
3
6 3 2 0 6 5 2 :
P1 0 6 5 6
p~ 0 0 1 4
'tlun.
Answer the following questions usmg the banker' s algon
i) What is the cpntent of matrix NEE~?
ii) Is the system_:in a safe state? If so, give safe sequence.
iii) If a _request / from process P1 arrives for (0, 4, 2, 0) can the request be granted
immediately. i 8
I BL: I 3 I CO: / 4_ I PSO: , ,

.
OR .
· 6 a) Define process synchl'onization. Exptain Peterson's solution for critical section problem. 6
: .. I BL: I 2 I CO: I S I I PO:; 2 I PSO: , ,

b) How Test_and_Set ( ) is implemented? Explain the algorithm that u~es Test_and_set ( )

instruction to satisfy ~y two requirements to the critical section problem. ! 6
· / BL: 2 co: s I
PO: : j 2 I I I j :rso: j 1

-c) Consider the following snapshot of a system:

:

Process Allocation Max Availabl~

A B C D A B C D A B c f D
Po 2 0 0 1 4 2 1 2 3 3 2 / 1
P1 3 1 2 1 5 2 5 :
2.
P2 2 1 0 3 2 3 I 6
P,
P3 1
1
3
4· ·3
4
6
1 2
2 · ·3
~swer the followmg.questions usmg the banker's algorithm.
1

1
2
6
.
4
5 I
1) Illustrate that the systemis
· ma
· sale
.c: • 1. • h
state by demonstrating an order:m which t e process
may complete. 1
ii) If
~ request from process P1 arrives for (1, 1, 0, 0) can the request be ~anted
'
immediately? 8
!
'
 -
[!L: I)
-3- Continued ...
.
U ni t- IV 3RCS05
7 a) With a neat diagram ~xplain the pa
gin g hardware with TLB.
. . \ .
b) Differentiate betwee .
~ paging and - ,-I
r.co=-L:-.-\-=--2
segmentation techniques
-CO-:-r\-6 -.--IP-0:. . .\-2--,.\-Pso-:-,\-•-- 6
.
.
c) Illustrate wi th neat
l I I I
6
~a ~a m
(!L : 4 CO: 6
how the address tran~lat1o , a two level page table scheme for structures
PO: 2 PSO: I I
I I I I
n is done for two level the page table. Show
: 32 b't ·
- 1 paging archi
\ tecture.
[ DL: \ 2 \ CO: \ 6 \ PO: \ 2 8
.
8 a) With a neat di ag r~ OR
,
processing a user pro~ illustrate the binding of instructions and
am. data memory address wh
ile

b) Differentiate betwee [ DL: \ 2 \ CO: I 6 I PO: I 2 I PSO: I • 6

n internal fragmentation
external fragmentation an d external fragmentation.
and explain in brief? What is the solution for

c) Explain with the ne

at diagram, an inverted
\ DL: \ 4 CO: \ 6 I
\ PO: : \ 2 \ PSO: \ I
6
What is the difficulty_sy pa ge table scheme for structur
stems using inverted pa ing the page table.
shared memory? ge .table have while sche
me is implemented using

\ DL: \ 2 I CO: \ 6
I PSO: I•
8

g a) With a neat diagram ex U ni t- V

pl ain the steps involved in
handling page fault.
I BL: I2 I CO: I 6 I PO: : 2 J 6
b) Consider the followi
ng page reference strea
ms 1, 2, 3, 4, 2, 1, 5, 6,
I PSO: \ I
How many page faults 2, 1, 2, 3\ 7, 6, ~,·2, 1, 2, 3: 6.
would occur for LRU,
FIFO and optimal replac
5 frames? em ent_algonthm assuming

\ BL: \ 3
\ CO: \ 6 9
c) Define thrashing. Li \ PO: ~) 2 IPSO: I I
si the various techniqu
es that can be used to av
\
oid thrash1ng.
\ DL: \ I \ CO:
5
\ 6 \ PO: \ 2 \ PSO: \ I
\ OR
a) Explain the .following\
strategi.es Wl'th respect to virtual memory
management:
i) Demand pagin~.
ii) Copy on wri\:L: \ 2
\ co: I 6 I ro_=_.1:_2 . I Pso: I • 6
b) Consider the followi \ . l 2 3 4 5 3 2,
pg page refere~ce usm 1, 6, 7, 8, ·3! 5, 4, 3, 7,
g · '. ' .' { ' ' nt alg
many page ·faults wou
ld occur for · the follo orithms ~ssuming 4 2. How
. .
!
wi ng r~~ ace~e l frames.
lmttally 4 frames are\e . FI i
") FO
mpty, ) LRU. 11 [• m) Optima .
1 . :
. .
" \
3 \ co, \ ,
j,2 I'"'
,so, 1 I I 9
• c) Describe how L ~\
OS message memo ry in[ithe sy
" stem. co,
I' I I• I I\ ; s
,o, 1 IPSO: I I
 Question Bank

UNIT 1

1. Define Operating Systems and discuss its role from different perspectives.

2. Explain fundamental difference between i) N/w OS and distributed OS ii) web based and

embedded computing.

3. What do you mean by cooperating process? Describe its four advantages.

4. What are the different categories of system programs? Explain.

5. List out different services of Operating Systems and Explain.

6. Explain the concept of virtual machines. Bring out its advantages.

7. Distinguish among following terminologies i) Multiprogramming systems ii) Multitasking

Systems iii) Multiprocessor systems.

8. What is distributed operating system? What are the advantages of distributed operating

system?

9. What are system calls? Explain different categories of system calls with example?

UNIT 2

1. What do you mean by PCB? Where is it used? What are its contents? Explain.

2. Explain direct and indirect communications of message passing systems.

3. Explain the difference between long term and short term and medium term schedulers.

4. What is a process? Draw and explain process state diagram.

5. Define IPC. What are different methods used for logical implementations of message passing
systems.

6. Discuss common ways of establishing relationship between user and kernel thread.

7. Explain multithreading models.

UNIT 3

1. What are semaphores? Explain two primitive semaphore operations. What are its advantages?

2. Explain any one synchronization problem for testing newly proposed sync scheme.

3. Explain three requirements that a solution to critical–section problem must satisfy.

4. State dining philosopher’s problem and give a solution using semaphores. Write structure of

philosopher.

5. What do you mean by binary semaphore and counting semaphore? With C struct, explain

implementation of wait () and signal.

6. Describe term monitor. Explain solution to dining philosopher’s problem using monitor.

7. What is synchronization? Explain its hardware.

8. What are semaphores? Explain solution to producer-consumer problem using semaphores

UNIT 4

1. Why is deadlock state more critical than starvation? Describe resource allocation graph with a

deadlock, with a cycle but no deadlock.

2. What are two options for breaking deadlock?

3. Solve the deadlock to find safe or unsafe state.

4. Describe necessary conditions for a deadlock situation to arise.

5. Explain different methods to handle deadlocks.

6. Explain different methods to recover deadlocks.

 UNIT 5

1. What is paging and swapping?

2. With a diagram discuss the steps involved in handling a page fault.

3. What is address binding? Explain the concept of dynamic relocation of addresses.

4. Define external fragmentation. What are the causes for external fragmentation?

5. What is paging? Explain the paging hardware?

6.Memory partitions of 100kb,500 kb,200 kb,300kb,600 kb are available how would best ,worst,

first fit algorithm to place processes 212,417,112,426 in order. Which is the best algorithm?

7. Differentiate between internal and external fragmentation.

8.Consider the reference stream 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults

while using FCFS and LRU using 2 frames?

9. What are the methods of handling the page faults?

10. What is thrashing? What are the causes for thrashing?

UNIT 6

1. Explain the following i) file types ii) file operation iii) file attributes.

2. Explain the method used for implementing directories.

3. Describe various file access methods.

4. Explain file system mounting operation.

5. Mention the different file attributes and file types.

6. How free space is managed? Explain.

7. What are the three methods for allocating disk space? Explain.
 UNIT 7

1. Describe the access matrix model used for protection purpose.

2. Explain various disk scheduling algorithms?

3. Explain the access matrix structure employed in protection domain?

4. What are protection goals and principles?

5. Differentiate between mechanism and policy.

6. Write a short note on Revocation of access rights.

UNIT 8

1. Write short note on components of Linux system.

2. Explain the process management model of linux operating system.

3. What are the two file system models adopted in linux operating system?

4. Write notes on buddy system of memory management in unix.

5. Discuss the various components of linux system.

6. Interprocess communication in linux system.

7. What do you mean by cloning? How is it achieved in Linux systems?

8. What are the design principles of Linux operating systems? Explain.

Note: These Questions are from VTU previous year question papers.