Total No. of Questions Sl SEAT No.

P-1914 (Total

[60341-403
S.Y. B.B.A. (CA)
CA - 403 : OPERATING SYSTEM
(2019 Pattern) (Semester - IV)
Time : 2% Hours) [Max. Marks : 70
Instructions to the candidates
I) All questions are compulsory,
2) Figures to rhe right indieate fu marks.

) Attempt any Eight of the following : 18 x 161

a) Define Least Recently Used' in memory management.
b) Define Context Switch?
c) What is a page frame?
d) List various propeflies of the file.
e) What is 'seek time' in Disk scheduling?
f) What is compaction?
g) Define Belady's Anomaly
h) List any four characteristics of operating system
i) Define a safe stair
j) What is starvation ?

02) Attempt any Four of the following : 14 161 Exploin System Structure.
b) What is scheduling? Compare short term scheduler wi th lcmg tenn
scheduler.
c) Draw and explain Round Robin Scheduling with the help of an
example.
d) What are Semaphores? Explain the types of Semaphores.
e) Draw and explain the Contiguous Memory Allocation.
03) Attempt any Four of the following 14 161
a) State and explain Critical Section Problem.
b) Consider the following set of processes with the length of the CPU
ume given in milliseconds —
Process Burst lime Arriv al Tune

3 3
3 6
4 0
5 2
i) Draw Gantt chart using non preemptive Shortest Job first method.
ii) Calculate average Turnaround time & averageWaiting time.
c) What is a deadlock? How can deadlock be avoided?
d) Explain File System Access Methods.
e) Explain Paging in case of memcry management,

04) Attempt any Four of the following : 14 161

a) Assume there are a total 200 tracks present on the disk. if the request
queue is: 82. 170, 43, 140.24. 16. 190 and the initial position of the
head is 50. Apply Shortest Seek Time First (SSTF) disk scheduling
algorithm and calculate total head movement.
b) Explain Job Control Block with the help of a diagram.
c) What are the charæteristics and necessary conditions for a deadlock?
d) Consider the page reference string. 4, 7, 6, l , 7, 6, l, 2, 7, 2.
The number of frames in the memory is 3. Initially all frames are
empty. Find out the number of page faults respective to :
i) Optimal Page Replacement Algorithm ii) FIFO Page Replacement
Algorithm iii) LRU Page Replacement Algorithm
e) Explain memory management through Fragmentation with the help of a
diagram.
[60341-403 2
0.5) Write a short note on the following : 12 x 3= 61
a) Shortest Seek Time First.

b) LinkedAllæation for File System.

c) Address binding in case of memory management.
 vvvv

[60341-403 3
Total No. of Questions : 51 SEAT No. :
PA-197S [Total No. or Pages
[59541-403
S.Y. B B.A. (Computer Application)
CA 403 : OPERATING SYSTEM
 (2019 Pattern) (Semester - IV)
Time : 2% Hours) [Max. Marks 70
Instructions to the candidates:
All questions are cootptdsory.
2) Near diagrams must be drawn wherever necessary.

01) Attempt any Eight of the following.

a) Define the term operating system.
b)Define system program.
c) Which scheduler controls the degree of multiprogramming?
d) What is Turn-Around Time?
e) What is meant by Deadlock?
i) What is demand paging?
g) List any four attributes of files.
h) What do you mean by seek Time in Disk Scheduling.
i) What does FIFO and MFV stand for?

j Define Rol I back?

02) Attempt any fourofthe following. [4x4=161
a) List and explain services provided by the operating system.
b) Explain Process Control Block (PCB) with diagram.
c) Explain 'Dining Philosopher' Synchronization problem.
d) What is Frogmentation? Explain types of its in detail.
e) Describe I/O Hardware with its type of I/O devices.

03) Attempt any fourofthe following.

a) Explain various types of system programs.
b) Explain Indexed Allocation in detail.

RT.O.
c) The request queue is follows:
15. 27, 137, 18. 150, 65. 194.
Number oftracks = Oto 1'»
 Starting position occurrent head position = 128. Find total head
movement by applying SSTF (Shortest Seek Time First) disk
scheduling algorithm.

d) List any two types of Multiprocessor.

e) Consider the following set of processes with length of CPU Burst
time and arrival time in milliseconds.

Calculate tum around time, waiting time, average waiting time and
average turn around time using preemptive SJF scheduling algorithm.

04) Attempt any Four of the following. (4x4-161

a) Consider the following snapshot of the system.
Process Allocation Avaliable

B c B c
0 0 1 2 o o 1 2
o o o 1 7 5
1 3 5 4 2 3 5 6
0 6 3 2 O 6 5 2
0 0 1 4 0 6 5 6
Is the system safe? Justify?
If yes give safe sequence
b) Explain different methods for recovery from deadlock?

159541.403 2
c) Consider a reference string 4. 7, 6, l. 7. 6. l. 2, 7, 2 the number of frames
in the memory is 3. Fltid out number of page Faults respective to
i) FIFO ii) LRU
 d) Explain advantages and disadv of linked allocation methods.
e) Define the term:
i) Logical Address ii)
Physical Address

Q.5) Write short note on any Two of the following.

a) What is Interrupts.
b) What is medium term scheduler.
c) Explain semaphores and its types in detail.

159541.403 3

50
Total No, or Questions : Sl SEATNo. : P2137[Total

[58031-403
 S.Y. B.B.A.(C.A.)
CA - 403 : OPERATING SYSTEM
(2019 Pattern) (CBC'S) (Semester IV)
Time : nours} [Max. Marks ; 70
Instructions to the candidates:
1) Answer allquestions.
2) Figures to the right side indicate full marks.

Q/ ) Attempt any eight of the following : 18 x 16)

a) Define the term operating system.
b) What is meant by multiprocessing system?
c) What is prcxess?
d) Which scheduler controls the degree Of Multiprogramming?
e) Define Burst Time.
f) What is semaphores?
g) What do you mean by Rollback?
h) What is meant by Address Binding?
i) List various operation on Elle.
What do you mean by Seek Time in Disk Scheduling?

02) Attempt any four of the following : (4 x 4 = 16)

a) List and explain advantages of Multiprocessor system.
b) Explain Process Control Blcxk (PCB) in detail with diagram.
c) Explain different method for recovery from a deadlock.
d) What is Fragmentation? Explain types of fragmentation in details.
e) Calculate average turn around time and average waiting time for all set
of processes using FCFS algorithm.

P.T.O.
Processes Burst Tillie Arrival "linie

5 1
6
2 2
 4
Q.j) Attempt any four of the following : (4 x 4 = 16)
a) List and explain system calls related to and Job
b) Explain multilevel Feedback queue Algorithm.
c) Describe in detail the 'Dinning Philosopher Problem'
Synchronization problem.
d) Write a note on interrupts.
e) the following page reference string:
6. 7, 9.
The numlrr of Frames is 3. Show page trace and calculate page Fault
for the following page replacement schemes.
i) FIFO ii) LRU

04) Attempt any four of the following: 14 x 161 a) What is meant by Free Space
Management? Define Bit vector and Grouping.
b) Define the terms :
i) Logical Address ii) Physical Address
c) Explain Resource Allocation Graph in detail.
d) What are the difference between Preemptive and Non-Preemptive
Scheduling.
e) Assume there are total 0-199 tracks that are present on each surface of
the disk. If request queue is 68, 172, 4, 178, 130, 40, 118 and 136 initial
position of the head is 25. Apply FCFS disk scheduling algorithm &
calculate total bead Movement.

[58031-403 2
05) Write a short note on any two of the following : [2 x 3= 61
a) Write short note on solution for critical section
b) Write a short note on Medium-term schedular.
c) Explain Indexed Allocation briefly.

0000
 158031.403

51