M. Sc. (Computer Science) (Semester
(CBCS) Examination, 2017
OPERATING SYSTEM
Day Date: Saturday, 22-04-2017 Max. Marks: 70
Time: 10.30 AM to 01.00 PM
N.B. Q.1 and Q.2 is compulsory.
Attempt any three questions from Q. 3 to 7.
Figures to the right indicate full marks.
Q.1 Choose correct alternatives: 10
The Banker's algorithm is
to rectify deadlock to detect deadlock
to prevent deadlock to solve deadlock
Which of the following is not a necessary condition for
deadlock to occur?
Mutual exclusion Hold and wait
Wait and signal Circular wait
Swapping
Works best with many small partitions
Allows many programs to use memory simultaneously
Allows each program in turn to use the memory
None of these
When a computer is first turned on or restarted, a special type
of absolute loader called
Compile loader Boot loader
Bootstrap loader System loader
requirement for the solution to critical section problem.
Mutual exclusion Progress
Bounded Waiting All of above
A page fault occurs when
the Deadlock happens
the Segmentation starts
the page is found in the memory
the page is not found in the memory
Which of the following memory allocation scheme suffers from
external fragmentation?
Segmentation Pure demand paging
Swapping Paging
Page 2 of 2
Which of these is an example of a virtual resource?
Print server Virtual machine
Virtual memory All of the above
A scheduler which selects processes from Primary memory is
called
Long Term Memory
Medium Term Scheduler
Short Term Memory
Queue Scheduler
10) Which of these is a technique of improving the priority of
process waiting in Queue for CPU allocation?
Starvation Relocation Promotion Aging
State whether true or false: 04
A real time system has well defined and fixed time constraints.
In a segmentation scheme the logical memory will be divided
into pages.
The process of storing and restoring from PCB is called
context switch.
The storage replacement strategy program placed in the
largest hole in memory is best fit.
Q.2 Write short notes on the following: 08
Directory structure
Thrashing
Answer the following: 06
Differentiate between a preemptive and non-preemptive
scheduling.
What are the three major activities of an operating system with
regard to file management?
Q.3 Answer the following: 14
Write about Banker's algorithm in detail.
Explain different file allocation methods with advantages and
disadvantages.
Q.4 Answer the following: 14
Describe various approaches for recovering from deadlock.
What is semaphore? Explain three common uses of semaphore.
Q.5 Answer the following: 14
Discuss the performance on demand paging.
Explain critical section problem. What are the requirements that
critical section problem must satisfy?
Q.6 Answer the following: 14
Describe the access matrix facility in detail.
What is process? Explain the process state transition diagram.
Q.7 Answer the following: 14
What is multiprogramming? Explain distributed and time sharing
operating system.
Explain FCFS page replacement algorithm in detail.