Placement papers on Operating System - Set 5

Placement papers on Operating System - Set 5

1. Paging is implemented in

Operating system
Hardware
software
All of the above
View Answer / Hide Answer


2. Which of the following is not the approach to handlong deadlocks

Deadlock prevention
deadlock avoidance
detect and recovery
Virtual memory
View Answer / Hide Answer


3. Which scheduler selects which processes should brought in to the ready queue

Real-term
Long-Term
Middle-term
short-term
View Answer / Hide Answer


4. devide logical memory in to blocks with the same size as frames are called

Pages
Frames
Segments
Page table
View Answer / Hide Answer


5. Which memory alloaction policy allocate the largest hole to the process?

Best fit
Worst fit
First fit
None of them
View Answer / Hide Answer


6. when there is no enough memory to fit a process in memory , but the space is not continuous is called

Internal fragmentation
Virtual fragmentation
External fragmentation
None of the above
View Answer / Hide Answer


7. when a thread waits indefinitely for some resource, but other threads are actually using it is called

starvation
Demand paging
Segmentation
suspend
View Answer / Hide Answer


8. which policy restricts scanning to one direction only

SCAN
CSCAN
N-step SCAN
Both A and B
View Answer / Hide Answer


9. ___________ are very effective because a mode switch is not required to switch from one thread to another.

Kernel-level threads
User-level threads
Alterable threads
Application level threads
View Answer / Hide Answer


10. A process that execute only in main memory is referred to as ___________ and that allocated in disk is referred to a ____________.

virtual memory, true memory
virtual memory, real memory
real memory, virtual memory
imaginary memory, real memory
View Answer / Hide Answer