Master of Computer Application I (Science)
Examination: Oct Nov 2016 Semester II (New CBCS)
SLR No. Day
Date Time Subject Name Paper No. Seat No.
SLR U
09
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 the correct alternatives 10
A state is safe if the system can allocate resources to each process in some
order and still avoid a
Access Right Virus
Deadlock Inter Process Communication
A is the smallest allotment of logical secondary storage; that is,
data cannot be written to secondary storage unless they are within it.
Linked allocation File
Fragmentation None of these
The page replacement algorithm is based on the argument that the
page with smallest count was probably just brought and has yet to be used.
Least Recently used Least frequency used
Most frequently used FIFO
A process includes the process which contains global variables.
Data selection Queue
Program counter Pointer
Multithreading on multi-CPU machines concurrency.
Decrease Increase
Violates Diminish
For simplicity of implementation are numbered and referred to
by a number, rather than by
Segment Swapping
Memory Support System None of these
A oriented system provides a means to distinguish between
authorized and unauthorized usage.
User detection Security
Resource Protection
The operating system sets bit for each page to allow or disallow
access to the page.
Invalid 14 bit
Valid Both and
Page 1 of 2
Time sharing systems requires computer system, which
provides direct communication between the user and the system.
Well configured Interactive
Virtual Automatic
10) The seek time is the time for disk arm to move the heads to the cylinder
containing the
Disk head Desired vector
Desired sector I/O request
State true or false 04
The Round Robin is a special case of the general priority scheduling
algorithm.
Multiprogramming systems provide an environment in which various
systems resources.
The advantages of the virtual memory scheme is that it enables users to run
programs that are smaller than actual physical memory.
Kernel threads are supported and managed directly by the operating
system.
Q.2 Answer the following 06
State different type of queues in Process Management
What do you mean by Swapping?
Write a short note on the following 08
Contiguous Memory Allocation
Process Control Block
Q.3 Answer the following
What do you mean by Directory? State and describe in detail the most
common schemes for defining the logical structure of a directory.
Define Process. Discuss in detail fundamental model of Inter Process
Communication.
07
07
Q.4 Answer the followings
Define the term Operating System. Discuss in details various types of
Operating System.
State the principles of Least Recently used page replacement
algorithm. Perform LRU page replacement algorithm and calculate the
page fault rate on following string-number of frames-03
Reference string
07
07
Q.5 Answer the followings
State the Deadlock characterization. Explain in detail deadlock prevention
with appropriate prevention mechanism?
State and describes the principle of Shortest Seek Time First (SSTF) disk
scheduling algorithm. Perform SSTF with a disk queue request for I/O to
blocks on cylinder are as follows
Queue 118, 63, 112, 13, 65, 38, 88, 175, 53, 122, 28
Head starts at 48
07
07
Q.6 Answer the following
State the meaning of preemptive and non-preemptive scheduling. Discuss
in detail working of multilevel feedback queue scheduling with suitable
example.
Define demand paging technique? Discuss in detail various steps in
handling a page fault with respect to demand paging?
07
07
Q.7 Answer the following
Define the term Security. Enlist and discuss in detail forms of accidental
and malicious security violations
What do you mean by Multiprocessor Time Sharing Systems and also
elaborate it as CASE study and related analysis.