Master of Computer Application I (Science)
Examination: Oct/Nov 2016 Semester II (Old CGPA)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR U
14
Thursday
24/11/2016
10.30 AM
to
01.00 PM
Operating System
C

Instructions: Question no. 1 2 are compulsory
Attempt any three questions from Q. No. 3 to Q. No. 7
Figures to the right indicate full marks.
Total Marks: 70
Q.1 Choose correct alternatives 10
In algorithm, a small unit of time quantum or time slice is
defined
Long term scheduler Round robin
Shortest Job First Priority
The name begins at root and follows a path down to a specified
file, giving the directory names on path.
Relative path Directory path
Absolute path File-Directory path
The value of semaphore can range over an unrestricted domain.
Binary Decimal
Monitor Counting
The is akin to reader lock in that several processes can acquires
the lock concurrently.
Shared lock Exclusive lock O
System lock Hardware lock
A major problem with priority algorithms is
Disk storage Page replacement
Starvation None of these
The is responsible for resource allocation and de-allocation in a
computer system.
Resource supervisor Operating system
Allocation algorithm Compiler
The is the module that gives control of the CPU to the process
selected by the scheduler and it should be as fast as possible, since it is
invoked during every process switch
Control system Dispatcher
I/O event wait Memory scheduler
A interface is a window system with a pointing device to direct
choose from menus, and make selections and a keyboard to enter the text
Batch Fundamental
Window server Graphical user
Page 1 of 2
The buffer length is potentially infinite; thus, any number of
messages can wait in it.
Unbounded capacity Single capacity
Bounded capacity Zero capacity
10) As process enter the system, they are input into a which consists
of all processes in the system.
Device queue System queue
Job queue Ready queue
State True or False 04
A domain is a collection of access rights, each of which is an ordered pair
<object-name, rights-set>
A preemptive kernel allows a process to be preempted while it is running in
kernel mode.
A logical memory divide into same sized blocks is called as frame.
A treats is an attempt to break security and attack is potential for a security
violation.
Q.2 Write a short note 08
Threads
Critical section problem
Answer the following 06
What do you mean by process suspend and resume?
What do you mean by non-preemptive algorithm?
Q.3 Answer the following
Define the term process synchronization. Explain in detail Readers-writers
problem?
What are the various file operations? Explain in detail shortest seek time
First method with suitable example?
07
07
Q.4 Answer the followings
Discuss in detail various type of scheduler for process scheduling.
Calculate the total number of page fault using first come first serve (FCFS)
page replacement on following reference string having maximum 03 frames
0
07
07
Q.5 Answer the followings
What do you mean by Deadlock? Discuss in detail necessary conditions to
result system caught in deadlock
What do you mean by Independent and Cooperative Process? Explain in
detail how inter-process communication is made between processes?
07
07
Q.6 Answer the following
Discuss in detail vital role of Operating System as being resource allocator.
What do you mean by Demand paging? Discuss the steps to be taken to
handle the page fault.
07
07
Q.7 Answer the following
Describe CPU scheduling criteria. Discuss working of shortest job first
algorithm with suitable example.
Explain in detail concepts of system call with suitable example.
07
07