A race condition

a will result only if multiple processes access and update the same data concurrently

b happens when threads race to finish first

c occurs ehen a thread grabs a lock for a critical section, thus preventing another thread

d results when two or more threads with no shared data compete to be the first to access a critical section

Which of the following scheduling algorithms is always preemptive?

RR

FCFS

priority

SJF

multilevel feedback