(1) The long-term process scheduling determines when a program should become a process.

[TRUE FALSE]

(2) Preemptive short-term process scheduling can never be correctly implemented without hardware support to interrupt user processes.

[TRUE FALSE]

(3) Semaphore operations (wait and signal) can be implemented at a processor that does not have atomic instruction for the semaphore operations as long as interrupt can be disabled by the operating system.

[TRUE FASLE]

(4) The reason for a good program portability of user-level thread (ULT) to different operating systems is primarily because it is non-preemptive therefore it is less dependent on the preemptive implementation of an OS.

[TRUE FALSE]

(5) Round-robin (RR) short-term process scheduling can behave in exactly the same way FCFS short-term process scheduling does if we are not careful for its (RR) tuning.

[TRUE FASLE]

(6) Swap files are for holding pages in a secondary storage device when a memory page-fault happens.

[TRUE FASLE]

(7) We discussed that one of the ways to reduce page faults is to increase the capacity of the physical memory. Increasing the physical memory capacity may not reduce the page faults, but it will never increase the page faults for any case.

[TRUE FALSE]

(8) If a system is unsafe in deadlock avoidance, deadlock will happen. Thus any request that causes a system to be unsafe should be rejected.

[TRUE FALSE]

(9) One of the necessary conditions for priority inversion to happen is non-preemptive process scheduling.

[TRUE FALSE]

(10) If we increase the page size in virtual memory, it does not necessarily reduce the number of page faults because of Beladys anomaly.

[TRUE FALSE]

(11) If a set of processes use only one semaphore to guarantee mutual exclusion for an exclusive-use resource (one that requires mutual exclusion, such as DVD writer) starvation can never happen.

[TRUE FALSE]

(12) In the three file organization methods of contiguous, linked-list and index, the index organization is the most reliable since all the disk blocks in a file is managed by one data structure, which is index.

[TRUE FALSE]