Scribd
Upload
68 views2 pages

Assignment 1& 2 Final

This document contains instructions for two assignments for an Operating Systems II class. Assignment 1 asks students to explain segmentation with demand paging, deadlock prevention techniques, and how semaphores solve the critical section problem. Assignment 2 asks students to calculate page faults for LRU and FIFO page replacement algorithms and to calculate average turnaround and waiting times for processes under FCFS and SJN scheduling. Students are reminded to submit assignments in their assignment book by the specified due date.

Uploaded by

Heta Desai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
68 views2 pages

Assignment 1& 2 Final

This document contains instructions for two assignments for an Operating Systems II class. Assignment 1 asks students to explain segmentation with demand paging, deadlock prevention techniques, and how semaphores solve the critical section problem. Assignment 2 asks students to calculate page faults for LRU and FIFO page replacement algorithms and to calculate average turnaround and waiting times for processes under FCFS and SJN scheduling. Students are reminded to submit assignments in their assignment book by the specified due date.

Uploaded by

Heta Desai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

T.Y.B.C.A.

(Sem V)

SUBJECT : OS - II (504)
Assignment 1

1) Explain segmentation with demand paging.


2) What is deadlock prevention? Explain techniques of deadlock prevention.
3) What is semaphore? Explain how it solves the critical section problem.

Note :
* Assignment needs to be submitted in Assignment book only
* Submission dates will be declared in OS - II class
*Assignment submission is compulsory for each student.

Ass.Pro.Eeva Kapopara(BCA)
T.Y.B.C.A. (Sem V)

SUBJECT : OS - II (504)
Assignment 2

1) Consider the following page-reference string :


a, b, a, c, a, b, d, b, a, c, d.

How many page faults would occur for the following replacement

algorithms, assuming two frames ?

- LRU replacement.

- FIFO replacement.

Which is better? Why it is better? Explain

2) Consider the following table:

Process Arrival Time CPU Burst


P1 0 8
P2 1 4
P3 2 1
What is the average turnaround time and average waiting time with FCFS and SJN?

Note :
* Assignment needs to be submitted in Assignment book only
* Submission dates will be declared in OS - II class
*Assignment submission is compulsory for each student.

Ass.Pro.Eeva Kapopara(BCA)

You might also like