F.Y.M.C.A. (Under Faculty of Engg.) (Part II) Examination, 2016
OPERATING SYSTEM
Day Date Wednesdat, 30-11-2016 Total Marks 100
Time 10.30 a.m. to 1.30 p.m
Instructions Figures to the right indicate full marks.
Q. 3 A and Q. 5 A are compulsory.
1. Multiple choice questions. 20
provide an interface to the services made available by an operating
system.
System calls Semaphores Communication Monitors
A is a batch-system concept.
control card data card data control none of these
To start a new process, the shell executes a system call.
exec() fork() exit() write()
pipes on windows systems provide a richer communication
mechanism than their UNIX counter parts.
Ordinary Routine Labeled Named
A is memory that is dynamically allocated during process run
time.
heap section queue secondary
A process control block also called as
task control block task management block
process management block task process block
One measure of work is the number of processes that are completed per time
unit, called
waiting time turnaround time
response time throughput
P.T.O.
Seat
No.
SLR-ER 11
Under scheduling, once the CPU has been allocated to a process,
the process keeps the CPU until it releases the CPU either by terminating or
by switching to the waiting state.
CPU Preemptive Nonpreemptive Process
The section of code implementing request permission to enter its critical
section is the
entry section exit section in-section out-section
10) are prevented by requiring that critical regions be protected by
locks.
Mutual exclusion Race conditions
Semaphores None of these
11) A system is in the safe state if
the system can allocate resources to each process in some order and still
avoid a deadlock
there exists a safe sequence
both and
none of the above
12) is the deadlock avoidance algorithm.
Banker's algorithm Round-robin algorithm
Tasker algorithm Bitmap algorithm
13) One way to ensure that the circular wait condition never holds is to
impose a total ordering of all resource types and to determine whether one
precedes another in the ordering
to never let a process acquire resources that are held by other processes
to let a process wait for only one resource at a time
all of these
14) A deadlock avoidance algorithm dynamically examines the to ensure
that a circular wait condition can never exist.
resource allocation state system storage state
operating system resources
15) is the address generated by CPU.
Physical address Absolute address
Logical address None of the above
16) Run time mapping from virtual to physical address is done by
Memory management unit CPU
PCI None of the mentioned
17) To create a file the necessary steps are
allocate the space in file system make an entry for new file in directory
both and none of these
18) In the two level directory structure
each user has his/her own user file directory
the system has its own master file directory
both and
none of these
19) specifies user names and the types of access allowed for each
user.
ACL BPL TCL None of these
20) The process of dividing a disk into sectors that the disk controller can read
and write is
low-level formatting dividing
sectoring none of these
SECTION I
2. Write short note on (any 20
Mass storage management.
Operating system services.
Threads.
First-come, First-served scheduling.
Monitors.
SLR-ER 11
3. Explain process control block in detail. 10
Explain critical-section problem in detail. 10
OR
How system calls are used Explain with example. 10
SECTION II
4. Write short note (any 20
Necessary conditions for deadlock.
Swapping.
Single-level directory.
File direct access method.
FCFS disk scheduling.
5. Explain deadlock prevention in detail. 10
Explain paging hardware using proper diagram. 10
OR
Write a note on disk management. 10