OSY Question Paper Final
OSY Question Paper Final
S P M POLYTECHNIC, KUMATHE
Preliminary Exam
Instructions:
1. All questions are compulsory.
2. Illustrate the answer with neat sketches whether whenever necessary.
3. Figures to the right indicate full marks.
4. Assume suitable data if necessary.
1. Explain following terms with respect to memory management. I ) context switching ii) swapping
2. Define deadlock and state the necessary condition for deadlock.
3. Enlist different file allocation methods and explain any two.
4. Differentiate between Long term scheduler short term and medium term scheduler.
5. What is system call? state type of system calls with example.
6. Differentiate between pre-emptive and non-pre-emptive scheduling
Q.5 Attempt any TWO of the following: (6 x 2 = 12 Marks)
1.List free space management techniques? Describe in detail
2.the jobs are scheduled for execution as follows
process Arrival Brust time
time
P1 0 7
P2 1 4
P3 2 10
P4 3 6
P5 4 8
Solve the problem using i)SJF ii)FCFS
3.How optimal page replacement algorithm ? with example
4.Explain Multilevel Queue Scheduling
Q.6 Attempt any TWO of the following: (6 x 2 = 12 Marks)
1.Explain Round Robbin algorithm with example
P1 10 1
P2 4 2
P3 5 3
P4 3 4
ABCD ABC
D
P1 212 322
P2 401 902
P3 020 753
P4 112 112