University Of Pune Question Paper
M.C.A. (Commerce Faculty) (Semester – I) Examination, 2013
105 : OPERATING SYSTEMS
Time : 3 Hours Max. Marks : 80
Instructions : 1) All questions are compulsory.
2) Neat diagrams must be drawn whenever necessary.
1. Attempt any four of the following : (4×4=16)
a) What is Scheduler ? Explain short-term Scheduler in details.
b) Give the diagrammatic representation of two-level directory. Also list out the
disadvantages of two-level directory structure.
c) Explain necessary condition of deadlock to occur.
d) Explain multilevel feedback queues algorithm.
e) List the advantages of multiprocessor system.
2. Attempt any four of the following : (4×4=16)
a) List the reasons to switch over CPU from old process to new process.
b) Explain Dinning philosopher’s problem of process synchronization.
c) List the methods of implementing the page table. Explain any one in detail.
d) Explain Belady’s Anomaly with example.
e) Explain free space management method.
3. Attempt any four of the following : (4×4=16)
a) Write the steps to calculate physical address from logical address.
b) Explain in detail M.V.T. Job Scheduling.
c) Explain Swapping of two processes using disk as a backing store with diagram.
d) Calculate Average Turn around Time and Average Waiting Time for all set of
processes using pre-emptive Priority and FCFS Algorithm.
Process Burst Time Arrival Time Priority
P1 5 33
P2 8 22
P3 3 04
P4 2 1 1(high)
e) List advantages and disadvantages of Contiguous allocation method.
4. Attempt any four of the following : (4×4=16)
a) Compare Pre-emptive and Non-pre-emptive Scheduling.
b) What will happen if all processes are I/O bound in system ?
c) What do you mean by Processor Share in case of Round-Robin Scheduling ?
d) Explain the concept of valid and invalid bit in a page table with diagram ?
e) Consider the following page reference string :
2, 6, 3, 7, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6
The number of frames is 3. Show page trace and calculate page faults for the
following page replacement schemes :
i) MFU
ii) LRU
5. Attempt any four of the following : (4×4=16)
a) Explain Deadlock avoidance in detail.
b) List and explain different types of system call related Device Manipulation.
c) Explain DMA (Direct Memory Access) with the help of block diagram.
d) Consider the following snapshot of a system :
Process Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 1 0 0
P1 1 4 2 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following questions using Banker’s algorithms :
i) What is the content of Need Matrix ?
ii) Is the system in a safe state ? If yes, give the safe sequence.
e) Explain the following terms :
i) Seek Time in Disk Scheduling
ii) Race Condition
iii) Interrupt
iv) Page Fault
–––––––––––––––––
M.C.A. (Commerce Faculty) (Semester – I) Examination, 2013
105 : OPERATING SYSTEMS
Time : 3 Hours Max. Marks : 80
Instructions : 1) All questions are compulsory.
2) Neat diagrams must be drawn whenever necessary.
1. Attempt any four of the following : (4×4=16)
a) What is Scheduler ? Explain short-term Scheduler in details.
b) Give the diagrammatic representation of two-level directory. Also list out the
disadvantages of two-level directory structure.
c) Explain necessary condition of deadlock to occur.
d) Explain multilevel feedback queues algorithm.
e) List the advantages of multiprocessor system.
2. Attempt any four of the following : (4×4=16)
a) List the reasons to switch over CPU from old process to new process.
b) Explain Dinning philosopher’s problem of process synchronization.
c) List the methods of implementing the page table. Explain any one in detail.
d) Explain Belady’s Anomaly with example.
e) Explain free space management method.
3. Attempt any four of the following : (4×4=16)
a) Write the steps to calculate physical address from logical address.
b) Explain in detail M.V.T. Job Scheduling.
c) Explain Swapping of two processes using disk as a backing store with diagram.
d) Calculate Average Turn around Time and Average Waiting Time for all set of
processes using pre-emptive Priority and FCFS Algorithm.
Process Burst Time Arrival Time Priority
P1 5 33
P2 8 22
P3 3 04
P4 2 1 1(high)
e) List advantages and disadvantages of Contiguous allocation method.
4. Attempt any four of the following : (4×4=16)
a) Compare Pre-emptive and Non-pre-emptive Scheduling.
b) What will happen if all processes are I/O bound in system ?
c) What do you mean by Processor Share in case of Round-Robin Scheduling ?
d) Explain the concept of valid and invalid bit in a page table with diagram ?
e) Consider the following page reference string :
2, 6, 3, 7, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6
The number of frames is 3. Show page trace and calculate page faults for the
following page replacement schemes :
i) MFU
ii) LRU
5. Attempt any four of the following : (4×4=16)
a) Explain Deadlock avoidance in detail.
b) List and explain different types of system call related Device Manipulation.
c) Explain DMA (Direct Memory Access) with the help of block diagram.
d) Consider the following snapshot of a system :
Process Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 1 0 0
P1 1 4 2 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following questions using Banker’s algorithms :
i) What is the content of Need Matrix ?
ii) Is the system in a safe state ? If yes, give the safe sequence.
e) Explain the following terms :
i) Seek Time in Disk Scheduling
ii) Race Condition
iii) Interrupt
iv) Page Fault
–––––––––––––––––
0 comments:
Pen down your valuable important comments below