M.C.A. (Semester II) (CBCS) Examination Oct/Nov-2017
Science
OPERATING SYSTEM
Day Date: Wednesday, 22-11-2017 Max. Marks: 70
Time: 10.30 AM to 01.00 PM
Instructions: Q.1 and Q.2 are compulsory questions.
Attempt any Three Questions from Q.3 to Q.7
Figures to right indicate full marks.
Q.1 A Choose the correct alternative 10
A vulnerability of is spoofing, in which an unauthorized host
pretends to be an authorized host by meeting some authorization
criterion.
CPU Scheduler Firewalls
Attack Interrupt
The control and coordinates the use of hardware among the
various application programs for the various users.
Hardware system Memory
I/O devices Operating System
requires an interactive computer system, which provides
direct communication between the user and the system.
Time Sharing
Clustered system
Distributed System
Real Time Embedded System
The processes that are residing in main memory and are
and waiting to execute are kept on a list called the queue.
Circular Multilevel
Ready Device
Cooperative processes communication mechanism
that will allow them to exchange data and information.
Direct Inter-process
Indirect Independent
Under non-preemptive scheduling, once the has been
allocated to a process, the process keeps the until it
releases the either by terminating or switching to the waiting
state.
Memory I/O
File CPU
allocation requires that each file occupy a set of
block on the disk.
Noncontiguous Contiguous
Linked Best fit
Page 2 of 3
SLR-SM-9
requires that the operating system be given in advance
additional information concerning which resources a process will
request and use during its lifetime.
Deadlock tolerance Deadlock detection
Deadlock prevention Deadlock avoidance
Paging involves breaking physical memory into fixed sized called

Segments Fragments
Pages Frames
10) A is associated with each process, and the CPU is allocated
to the process with the highest
Shortest CPU burst cycle Round Robin
Priority Waiting time
State True or False 04
In the absence of expensive battery and generator backup systems,
data must be written to volatile storage for safekeeping.
The sequence of directories searched when a file is named, this
operation is called search path.
An implementation of virtual memory arrangement frees programmers
from concern over memory storage limitations.
A program is active entity, such as the contents of a file stored on the
disk.
Q2 Write a short note 08
Semaphore
Swapping
Answer the following 06
What do you mean by File?
Briefly state the meaning of Thread.
Q3 Answer the following
Discuss in detail various types of fragmentation with suitable example. 07
What do you mean by unsafe state? Explain in detail how to detect
deadlock?
07
Q4 Answer the following
Explain working mechanism of Round Robin scheduling for processes given
below
07
PID Name Burst Time Time Quantum
101 ABC 16 minute
04 Minute
102 XYZ 08 minute
103 PQR 14 minute
104 MNO 12 minute
What do you mean by allocation methods? Explain in detail different kinds of
allocation methods in file system implementation?
07
Q5 Answer the following
Define the term Demand Paging. Explain in detail steps to handle a page
fault?
07

Explain in detail working of SCAN, algorithm when a Disk head is positioned
at 55.
Queue 95, 63, 38, 81,102, 61,72, 86,55,49,78
07
Page 3 of 3
SLR-SM-9
Q6 Answer the following
Discuss working of First in First Out page replacement algorithm for given
below reference string having 03 frames for allocation.
Reference string 6
07
Explain principle of process synchronization by explaining Dining
Philosopher problem in detail?
07
Q7 Answer the following
What do you mean by Threat? Explain in detail different kinds of program
threats?
07
State and Differentiate between Distributed OS and Multiprocessor time
sharing system?