M.C.A. (Science) (Semester-II) (CBSC) Examination, 2017
OPERATING SYSTEM
Day Date: Monday, 24-04-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 the right indicate full marks.
Q.1 Choose the correct alternative 10
A…… is a named collection of related information that is
recorded on secondary storage.
Physical storage File E
Disk structure Device
If policy is to use the recent past as an approximation of the
near future, then policy is to replace the pages that has not
been used for the longest period of item, then this approach
is the ……………… algorithm.
FIFO Most Frequently Used E
Least Frequently
Used
Least Recently Used
A……………… is a memory management scheme that
supports user view of memory.
Segmentation Fragmentation E
Memory Support
System
Swapping
The …………… share the memory and the resources of the
process to which they belong.
CPU Devices E
Thread Job Queue
In page table, when a bit is set to ……., the associated page
is in the process's logical address space.
Null Valid E
14 bit Invalid
A state is ……. if the system can allocate resources to each
Page 2 of 3
process in some order and still avoid a deadlock.
Unsafe Safe E
Both and Blocking
……………. is mechanism for controlling the access of
processes or users to the resources defined by a computer
system.
Security Protection E
Resource utilization Error Detection
A…………..generally also includes the ……. stack, which
contains temporary data.
Kernel Memory E
CPU Process
………. System is a logical extension of multiprogramming, in
which CPU executes multiple jobs by frequently switching
among them.
Clustered Time Sharing E
Handheld None of these
10) The …… is the time for disk arm to move the heads to the
cylinder containing the desired sector.
Dispatch latency Rotational latency E
Mount Time Seek Time
State True of False 04
A major problem with Shortest Job First Scheduling
algorithm is aging.
Multiprogramming increases CPU utilization by organizing
jobs so that the CPU always has none to execute.
A virtual memory is a technique that allows the execution
of a process that is not completely in memory.
User-level threads are managed by CPU library and the
kernel is completely aware of them.
Q2 Answer the following 06
What do you mean by System calls?
ii) Briefly state a task of Context Switch
Write a short note on the following 08
Priority Scheduling
ii) Semaphore
Q3 Answer the following
Define the term Directory. Discuss in detail the most common
schemes for defining the logical structure of a directory.
07
What do you mean by Process? Explain in detail the mechanism
of an Inter Process Communication for the purpose of process
07
Page 3 of 3
Management.
Q4 Answer the following
Define the term Operating System. Explain detail various types
of Operating System?
07
State the principle 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
2
07
Q5 Answer the following
What do you mean by Deadlock? Discuss in details deadlock
avoidance algorithm with suitable example.
07
State and describe the principal of Shortest Seek Time First
(SSTF) disk scheduling algorithm. Perform SSTF with a disk
queue requests for I/O to blocks on cylinder are as follows-
Queue 88, 175, 28, 112, 13, 118, 63, 65, 38, 122, 53
Head starts at 50
07
Q6 Answer the following
What do you mean by Preemptive Scheduling? Discuss
multilevel feedback queue scheduling with suitable example.
07
Discuss in details concept of Demand paging by describing
steps involved in handling a page fault.
07
Q7 Answer the following.
What do you mean by Security? Enlist and describe in details
that includes forms of accidental and malicious security
violations.
07
What do you mean by Network Operating System
Elaborate NOS as CASE study and related analysis.