(A) Internal fragmentation
(B) Segmentation
(C) External fragmentation
(D) Swapping
Updated on 08/12/2021
Related Posts 👇
-
In deadlock prevention scheme to ensure that the hold and wait condition never occurs in the system if?
(A) Whenever a process requests a resource it does not hold any other resources.
(B) At least one resource must be sharable
(C) At least one resource must be non-sharable
(D) All of the aboveUpdated on 05/06/2022
-
In deadlock prevention scheme the mutual exclusion condition must hold if?
(A) Whenever a process requests a resource it does not hold any other resources
(B) At least one resource must be shareable
(C) At least one resource must be non-shareable
(D) All of the aboveUpdated on 05/06/2022
-
Deadlock prevention scheme applied if?
(A) By ensuring that at least one of these conditions can hold
(B) By ensuring that at least one of these conditions can not hold
(C) Each of the four necessary conditions must hold
(D) All of the aboveUpdated on 05/06/2022
-
Deadlock prevention strategies are very?
(A) Complex
(B) Simple
(C) Straight
(D) ConservativeUpdated on 05/06/2022
-
Circular wait condition can be prevented by denning a linear ordering of?
(A) Resource type
(B) Process type
(C) User type
(D) Program typeUpdated on 05/06/2022
-
To avoid deadlock?
(A) Resource allocation must be done only once
(B) All deadlock processes must be aborted
(C) There must be a fixed number of resources to allocate
(D) None of the aboveUpdated on 05/06/2022
-
Which one of the following is a visual(mathematical) way to determine the deadlock occurrence?
(A) Inversion graph
(B) Starvation graph
(C) Resource allocation graph
(D) None of the aboveUpdated on 05/06/2022
-
A problem encountered in multitasking when a process is perpetually denied necessary resources is called?
(A) Inversion
(B) Aging
(C) Starvation
(D) DeadlockUpdated on 05/06/2022