B.C.A. (Semester IV) (CBCS) Examination Mar/Apr-2018
OPERATING SYSTEM
Time: 2½ Hours
Max. Marks: 70
Instructions: All Questions are compulsory. Figures to the right indicate full marks.
Q.1
Choose the correct alternatives:
10
To access the services of operating system, the interface is provided by the
System calls
API
Library
Assembly instructions
operating systems allows many users to use a computer system interactively at the same time.
Batch
Multiprogramming
Real-time
Time-Sharing
Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called an
Shared Memory
Entry Section
Race Condition
Synchronization
LRU stands for
Light Repeat Unit
Least Recently Used
Last Recent Used
Local Recent Used
With a page is brought into main memory only when a reference is made to a location on that page.
Prepaging
Demand paging
Page buffering
Swapping
is a Memory-Management Scheme that Permits the Physical address space of a process to be non-contiguous.
Paging
Deadlock
Fragmentation
Memory Allocation
There is wasted space internal to a partition due to the fact that the block of a data loaded is smaller than the partition, is referred to as
External fragmentation
Internal fragmentation
Simple fragmentation
Dynamic fragmentation
are a set of blocked processes each holding a resource and waiting to acquire a resource held by another process.
Deadlocks
Mutual Exclusion
Bankers
All the these
Which scheduling policy is best suited for time-sharing operating systems?
First come first served
Shortest Job First
Round Robin
None of these
Page 2 of 2
SLR-SR-19
10) A process is selected from the queue by the scheduler, to be executed.
Blocked, short term
Wait, long term
Ready, short term
Ready, long term
Q.1
State whether True or False:-
04
In a fixed partition system, main memory is divided into several partitions of the same size.
One of the disadvantages of the priority scheduling algorithm is that: it can lead to some low priority process waiting indefinitely for the CPU.
A process in the running state is currently being executed by the CPU.
Virtual memory space is always smaller than physical memory space.
Q.2
Solve any seven from the following.
14
What are components of operating system?
Define Resource Allocation Graph?
What is multilevel Queue scheduling?
What is Swapping?
What is Compaction?
List out File Types.
Define real time OS.
Define layered structure.
Define thread and list its types.
Q.3
Solve any two of the following.
10
Explain short term and Long term scheduler.
Explain File Protection.
Explain virtual machine.
Explain Critical Region.
04
Q.4
Answer any two from the followings:-
14
Explain Banker Algorithms with example.
Consider the following page reference string: Remember 3 frames are initially empty
6. How many page faults would occur for the LRU LFU replacement?
Explain dining philosopher problem.
Q.5
Answer any two from the followings:-
14
Explain segmentation in details.
Example semaphore in details.
Consider the all the following 5 processes arrive at time in the order given the burst time are as follows. Solve FCFS, SJF and RR (quantum 10 ms) scheduling algorithms for the set of processes. Draw Gantt chart. Which algorithm would give the minimum average waiting time?