Scribd
Upload
13 views4 pages

UCSE502 2021 Odd Regular BTech CSE 5

Uploaded by

nabadeepdas069
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
13 views4 pages

UCSE502 2021 Odd Regular BTech CSE 5

Uploaded by

nabadeepdas069
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

Total No.

of printed Pages : 4
1 CSE

202t

OPER.{TING SYSTEM
Full Marks - 100

Tiine - Three hours

The figures in the margin indicate full marks


fbr the questions.

Answer atty five questions.

1. (a) What is the kernel of an OS ? Explain with


a diagram layered architecture of an operat-
ing system. 2+5:7

(b) What is multi-programming, time sharing and


multi-processor OS ? 3

(c) What is the purpose of system calls, and how


do system calls relate to the OS and to the
concept of dual-mode (kernel-mode and user'-
rnode) operation ? 5

[Turn over
(d) What is an Open source operating system ?
Give example of any two open source ope-
rating systems. a
J

(e) What is Virtual machine ? 2

2. (a) What is swapping and what is its purpose ?


"15
(b) Explain Process state with a diagram. l0
(c) What is semaphore ? Explain its implernen-
tation as wait and signal for providing
process synchronization. 5

3. (a) Explain the preemptive and non-preemptive


versions of SJF and Round Robin (time slice
: 2) scheduling algorithms with Ganu Chart
for the four processes given. Compare their
average turn around and waiting time. lz
Process Arrival Time Burst Time
PI 0 10

P2 I 06
,".
P3 ')
L ,12
i
b+ J l5
l

95/1 9/5th Sem/UCSE502 (2) '


(b) Consider the following
l, 2, 3, 4, 5, 3, 4,
9, 5,4,4, 5,3. How
occur for the LRU
ment algorithms ?
all frames are initially
4. (a) With a neat sketch explain how logical
address is translated into physical address
using paging mechanism l0

(b) Compare contiguous and non-contiguous


memory allocation techniques. 5

(c) What is external and internal fragmentation ?


5

5. (a) Given free memory partitions of 100 K,


500 K, 200 K, 300 K, and 600 K (in order),
how would each of the First-fit, Best.fit, and
Worst-fit algorithms place processes of
212 K, 417 K, ll2 K, and 426 K (in order) ?
8
l

(b) A disk drive has 200 cylinders, numbered 0


to I99. The drive is currently serving a
request at cylinder 53. The queue of pending
requests, in FIFO order, is 98, 183,37,122,
14, 124, 65, 67. Starting from the current

95l19l5th Sem/UCSE502 (3) [Turn over


head position, what is the total distance (in
cylinders) that the disk arm moves to satis$
all the pending requests for each of the

(i) FCFS
'4,. \r
(ii) scAN fa
(iii) LooK
(iv) C-SCAN

6. (a) Explain the bankers


example. 10

(b) How does deadloc,k avoidance ditTer from


deadlock prevention ? -5

(c) What is the critical section ? Wlrar are: the


minimum requirements that should be satis-
fied by a solution to critical secticln problena ?
5

7. Write short notes on : 10x2:20


(a) Dining Philosopher's Problem.

(b) Evolution of Operating System.

95/l9l5th Sem/UCSE502 (4) 150

You might also like