Total No. of Questions : 5] SEAT No.

82
PB1883 [Total No. of Pages : 2

ic-
[6237]-501

t
sta
T.Y.B.Sc.

5
COMPUTER SCIENCE

8:0
CS-351 : Operating Systems - I

1
3:2
4/2 21
(Revised 2019 Pattern) (New CBCS) (Semester-V) (Paper-I)

41
3/0 10
02
Time : 2 Hours] [Max. Marks : 35
0
Instructions to the candidates:
9.8 AP

1) All questions are compulsory.

2) Figures to the right indicate full marks.
49 CA

22

3) Neat diagrams most be drawn wherever necessary.

82
4) Assume suitable data if necessary.

ic-
.21

tat
Q1) Attempt any Eight of the following. [8×1=8]

5s
a) List types of Senaphore.
2.1

8:0
b) Define segmentation.
11
20

3:2
c) Which schedular controls the degree of multiprogramming.
02
41

d) What do you mean by system call?

02
01
4/2

e) Define system booting.

AP
3/0

f) What do you mean by thread?

CA
22

g) List the purpose of synchronization.

-82
9.8

h) Define the term Dispatcher.

tic
.21

sta
i) Define CPU bound process.
49

:05

j) Define Virtual Memory.

2.1

:28
11
20

13

Q2) Attempt any four of the following. [4×2=8]

02
24

a) List the benefits of thread.

01
/20

b) List advantages of pre-emptive and non-premptive scheduling algorithm.

9.8 AP
/04

c) Define operating system. Write any two tasks of O.S.

3
CA
22

d) Consider refference string 1, 3, 3, 2, 5, 4, 5, 4, 1, 4, 2, 2, 5 and number

of frames are three. Calculate total no. of page faults using optimal page
.21

replacement Algorithm.
49

e) A counting semaphore S is initialized to 10. Then 6p operations and 4v

2.1

operations are performed on S. What is the final value of 8?

20

P.T.O.
Q3) Attempt any Two of the following. [2×4=8]

82
a) What is process? Explain the different types of process states.

ic-
b) Consider the following snapshot of a system.

t
sta
Process CPU Burst time Arrival time

5
P1 5 3

8:0
P2 2 0

1
3:2
4/2 21
P3 2 4

41
P4 3 5
3/0 10
02
Draw the Gratt chart and calculate average wairting and average turn
0
around time for the follwing scheduling algorithms.
9.8 AP

i) Preemptive SJF.
49 CA

22

ii) Round Robin (Time Quantum = 2)

82
c) Compare MFT and MVT of memory partation.

ic-
.21

tat
Q4) Attempt any two of the following. [2×4=8]

5s
a) What is critical section problem? Give peterson’s solution to solve critical
2.1

8:0
11
section problem.
20

3:2
b) Consider the following segment table
02
41

Segment Base Length

02
01

0 600 120
4/2
AP

1 1200 350
3/0

2 75 85
CA
22

3 1760 90

-82
9.8

What are the physical addresses for the following logical addresses.
tic
.21

i) 0,125
sta
49

ii) 1,310
:05
2.1

iii) 3,88
:28
11
20

iv) 2,77
13
02

c) Explain multilevel queue scheduling Algorithm.

24
01
/20

Q5) Attempt any one of the following. [1×3=3]

9.8 AP
/04

a) Define swaping. Write advantages & disadvantages of swapping.

3

b) Explain different types of services provided by an operating system.

CA
22

eeee
.21
49
2.1
20

[6237]-501 2