5. The ( 6 ) is used to implement mutual exclusion where it can be decremented by a process and incremented by another, but the value must either be 0 or 1. 6. If deadlock prevention approach is used to deal with deadlocks in a system, the ( 7 ) condition can be prevented using the direct method. 7. Two threads may share the memory space, but they cannot share the same ( 8 )
Fill in the blanks:
5. The ( 6 ) is used to implement mutual exclusion where it can be decremented by a
process and incremented by another, but the value must either be 0 or 1.
6. If deadlock prevention approach is used to deal with deadlocks in a system, the ( 7 )
condition can be prevented using the direct method.
7. Two threads may share the memory space, but they cannot share the same ( 8 )
8. Consider round-robin (RR) scheduling
slice and it is now selecting a new process; if we have 3 blocked processes (A, B, and C),
and A has been waiting the longest, then A would need to wait a period of ( 9 ) seconds
to be selected.
9. In real-time systems, if a task appears at random times, then it is considered ( 10 ).
Step by step
Solved in 2 steps
