(A) Frame
(B) Segment
(C) Page
(D) None of the above
Tag: Operating System Mcq With Answers
First fit and best fit algorithm can be used for?
(A) Swapping
(B) Paging
(C) Segmentation
(D) Contiguous Memory Allocation
Moving process between main memory and the disk is called?
(A) Swapping
(B) Paging
(C) Fragmentation
(D) None of the above
Resources are allocated to the process on the non-sharable basis is?
(A) Mutual exclusion
(B) No Preemption
(C) Hold and Wait
(D) Circular wait
Which are the necessary conditions of deadlock?
(A) Mutual exclusion
(B) Hold and wait
(C) Circular wait
(D) No Preemption
(E) All of the above
In resource request algorithm which condition is checked to avoid deadlock?
(A) Request<=available
(B) Request<=need
(C) Both of the above
(D) None of the above[showhide type="post" more_text="►Correct Option" less_text="Show less..."]
Correct Answer is: C
[/showhide]
Situation where set of processes are blocked because each process is holding a resource and waiting for another resource held by some other process is called?
(A) Segmentation
(B) Paging
(C) Starvation
(D) Deadlock
PCB stands for?
(A) Program control block
(B) Process control block
(C) Program control board
(D) Process control board