Scribd
Upload
84 views

Essential of Operating System Prelim Paper 2018

This document provides instructions for an operating systems exam with 7 questions. It includes questions about: 1) RAID structures and disk scheduling algorithms like First Fit, Best Fit, and Worst Fit. 2) The round robin scheduling algorithm with an example. 3) Solving a shortest seek time first (SSTF) disk scheduling problem with a visual representation. 4) Checking if a system is in a safe state, finding the need matrix, and determining if an additional resource request can be granted. 5) Calculating page faults using LRU, FIFO page replacement algorithms with a given reference string and 3 frame sizes. 6) Expl

Uploaded by

susmita shenmare
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
84 views

Essential of Operating System Prelim Paper 2018

This document provides instructions for an operating systems exam with 7 questions. It includes questions about: 1) RAID structures and disk scheduling algorithms like First Fit, Best Fit, and Worst Fit. 2) The round robin scheduling algorithm with an example. 3) Solving a shortest seek time first (SSTF) disk scheduling problem with a visual representation. 4) Checking if a system is in a safe state, finding the need matrix, and determining if an additional resource request can be granted. 5) Calculating page faults using LRU, FIFO page replacement algorithms with a given reference string and 3 frame sizes. 6) Expl

Uploaded by

susmita shenmare
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

JAYAWANT SHIKSHAN PRASARAK MANDAL’s

Jayawantrao Sawant college of Engineering,Hadapsar ,Pune


Preliminary Examination, April 2018
(IT-21) Essentials of Operating System (2015 Pattern)
MCA(Semester - II)
Date:02/04/2018 Time:10:00am-01.00pm
Duration: 3 Hours Max. Marks : 70

Instructions: 1) Q. 1 is compulsory.
2) Attempt any five from the remaining.
3) Figures to the right indicate full marks.

Q1. A) Explain RAID structure in detail. 10.


B) Explain First fit ,Best fit ,worst fit algorithm 10.
Q2. Explain Concept of round robin Scheduling with example 10.
Q3 Consider Example of disk queue with request involving tracks to
read: 100,190,50,150,25,155,70 and 85 we are assuming disk with 200 tracks and the head
position of the system is at track 55,solve using SSTF with visual representation
Q4. Consider the following snapshot of the system 10.
Process Allocation Maximum Available
A B C A B C A B C
P0 0 0 1 0 0 1 2 2 2
P1 1 0 0 1 7 5
P2 1 3 5 2 3 5
P3 0 6 3 0 6 5

Check
a) The system is in safe state or not, find safe sequence
b) Find the contents of Need () matrix.
c) If additional request for resources(0,4,2) arise form process p3, can the request
be granted immediately ?

Q5. Consider the following reference string 10.


1, 2, 4, 3, 2, 1, 3, 4, 1, 2, 3, 2, 1, 4, 3, 2,1
How many page faults would occur in LRU, FIFO and Assume Frame size of 3.

Q6. Explain the concept of deadlock also explain deadlock recovery in short 10.

Q7. Write short note (any 2) 10.


a) Logical view physical view of OS
b) segmentation
c) Dining philosophers problem

You might also like