Placement papers on Operating System - Set 4

Placement papers on Operating System - Set 4

1. The number of processes completed per unit time is known as __________.

Output
Throughput
Efficiency
Capacity
View Answer / Hide Answer


2. A critical region

is a piece of code which only one process executes at a time
is a region prone to deadlock
is a piece of code which only a finite number of processes execute
is found only in Windows NT operation system
View Answer / Hide Answer


3. The mechanism that bring a page into memory only when it is needed is called _____________

Segmentation
Fragmentation
Demand Paging
Page Replacement
View Answer / Hide Answer


4. FIFO scheduling is ________.

Preemptive Scheduling
Non Preemptive Scheduling
Deadline Scheduling
Fair share scheduling
View Answer / Hide Answer


5. Switching the CPU to another Process requires to save state of the old process and loading new process state is called as __________.

Process Blocking
Context Switch
Time Sharing
None of the above
View Answer / Hide Answer


6. Which directory implementation is used in most Operating System?

Single level directory structure
Two level directory structure
Tree directory structure
Acyclic directory structure
View Answer / Hide Answer


7. The Banker's algorithm is used

to prevent deadlock in operating systems
to detect deadlock in operating systems
to rectify a deadlocked state
none of the above
View Answer / Hide Answer


8. A thread

is a lightweight process where the context switching is low
is a lightweight process where the context swithching is high
is used to speed up paging
none of the above
View Answer / Hide Answer


9. ______ is a high level abstraction over Semaphore.

Shared memory
Message passing
Monitor
Mutual exclusion
View Answer / Hide Answer


10. A tree sturctured file directory system

allows easy storage and retrieval of file names
is a much debated unecessary feature
is not essential when we have millions of files
none of the above
View Answer / Hide Answer