T/F question about operating system, thank you
1. A deadlocked system must involve at least two threads/processes that are deadlocked.
2. If all 4 following conditions hold in a system: mutual exclusion, hold and wait, circular waiting, and no pre-emption, then a deadlock must occur.
3. In avoidance strategy, the OS may refuse to allocate requested resources if there is a potential for a deadlock.
4. Given a reusable resource graph representing a state S, state S is a deadlock state if, and only if, the serially reusable resource is not completely reducible.
5. Analysis used for the reusable resource systems can work directly for consumable resource systems.
6. A consumable resource graph can never be completely reducible.
7. Internal fragmentation refers to the phenomenon where a portion of primary memory is allocated to a process but is not mapped to its address space.
8. Dynamic address biding is associated with variable-partition memory strategies and not fixedpartition memory strategies.
9. The first-fit strategy is better than the best-fit strategy when the memory partitions are of small sizes. 10. The relocation register is not changed each time a different process is allocated to the CPU because it is common to all processes.
1) A deadlocked system must involve at least two threads/processes that are deadlocked.
It is TRUE.
In order to be a deadlock in the system, there must be an involvement of two or more processes. A system with one process may starve, but will never lead to a deadlock.
2) If all 4 following conditions hold in a system: mutual exclusion, hold and wait, circular waiting, and no preemption, then a deadlock must occur.
It is TRUE.
If all the four necessary conditions for deadlock is satisfied, then the system must be in deadlock state.
3) In avoidance strategy, the OS may refuse to allocate requested resources if there is a potential for a deadlock.
It is TRUE.
In order to avoid deadlock the operating system should never allocate resources that may lead to deadlock.
4) Given a reusable resource graph representing a state S, state S is a deadlock state if, and only if, the serially reusable resource is not completely reducible.
It is FALSE.
Given a reusable resource graph representing a state S, state S is not in deadlock state if, and only if, the serially reusable resource is not completely reducible.
5) Analysis used for the reusable resource systems can work directly for consumable resource systems.
It is FALSE.
Analysis used for the reusable resource systems can not work directly for consumable resource systems.
6) A consumable resource graph can never be completely reducible.
It is FALSE.
A consumable resource graph can be completely reducible for deadlock free systems.
7) Internal fragmentation refers to the phenomenon where a portion of primary memory is allocated to a process but is not mapped to its address space.
It is TRUE.
Internal fragmentation refers to the phenomenon where a portion of primary memory is allocated to a process but is not mapped to its address space.
8) Dynamic address biding is associated with variable-partition memory strategies and not fixed partition memory strategies.
It is TRUE.
Dynamic address binding is associated with variable-partition memory strategies and not fixed partition memory strategies.
9) The first-fit strategy is better than the best-fit strategy when the memory partitions are of small sizes.
It is FALSE.
When the memory partitions are of small sizes, then the first fit strategy may provide contiguous allocation. But the wastage of memory will still be greater than the best fir strategy.
10) The relocation register is not changed each time a different process is allocated to the CPU because it is common to all processes.
It is FALSE.
The relocation register value is changed each time a different process is allocated to the CPU by the operating system.
Hope this helps.
T/F question about operating system, thank you 1. A deadlocked system must involve at least two...
T/F about operating system, thank you very much 1. A compiler belongs to an application programming interface. 2. An OS is distinguished from other system software in that it runs faster because it has exclusive control of the processor. 3. One advantage of resource abstraction is that it provides the most efficient use of resources. 4. Use of metered automobile parking space is an example of time-multiplexed sharing. 5. Space-multiplexed sharing is related to swapping processes to and from disks.