Which of the following short-term process scheduling algorithm(s) can cause a race condition among user processes? Select all that apply.

1. FCFS
2. RR
3. SJF
4. SRTF
5. None of the above

Which of the following statements regarding how race conditions happen is (are) correct? Select all that apply.

1. If all the user processes are all in the same execution priority, a race condition can never occur.
2. If each user processes (i.e., processes execute in the user mode of processors) could disable and enable interrupt, a race condition can never occur.
3. If processes do not share any resource, such as data in memory and I/O devices, a race condition can never occur.
4. Even though processes share some resources, as long as none of the modify any of those shared resources, a race condition can never occur.
5. To prevent a race condition from happening, context-switching should not happen to a process which is currently in a critical section.

What is the positive effect in using preemptive process scheduling? Select all that apply.

1. Improving throughput
2. Improving average turnaround time
3. Improving average response time
4. Improving (reducing) process starvation
5. Improving processor utilization
6. Improving (reducing) thrashing
7. None of the above

Suppose that processes are going to perform wait operation to two binary (mutex) semaphores consecutively. About the order of how wait to the two binary semaphores are performed, select the correct statement(s) below (select all that apply).

1. If processes perform wait operations to the two semaphores in different orders, race condition can happen, but process deadlock can not.
2. If processes perform wait operations to the two semaphores in different orders, race condition can not happen, but process deadlock can.
3. If processes perform wait operations to the two semaphores in different orders, both race condition and process deadlock can happen.
4. If processes perform wait operations to the two semaphores in different orders, neither race condition nor process deadlock can happen.
5. None of the above.

What is (are) possible negative side effect(s) for all or nothing method to prevent hold & wait condition from being satisfied? Select all that apply.

1. Processes that need a smaller number of resources have a higher chance for waiting, causing starvation to them.
2. Processes that need a larger number of resources will be executed slower after they acquire all the resources they need.
3. Processes that need a smaller number of resources have a higher chance of making incorrect outputs because of more chances of race conditions to them.
4. Processes that need a larger number of resources will suffer from worse turnaround time since acquiring resources will take longer time for them.
5. Processes that need a smaller number of resources have poor response time.