Answer multiple choice questions for my Concurrent Programming subject:

$1.$ Which of the following scheduling strategy is most likely to suffer from starvation? $\_\_\_\_\_.$

A$.$ preemptive shortest job first

B$.$ round robin

C$.$ multi$-$level feedback queue

$2.$ Which of the following does a thread not own a private copy? $\_\_\_\_\_.$

A$.$ stack

B$.$ heap

C$.$ stack pointer

D$.$ none of the above

$3.$ Which hardware function or method can help implement a fair spin lock? $\_\_\_\_\_.$

A$.$ test$-$and$-$set

B$.$ fetch$-$and$-$add

C$.$ all of A$,$B

D$.$ none of A$,$B

$4.$ In the Dining Philosopher problem, changing the order of one philosopher$$s fork$-$pickup actions, is to

tackle which condition to prevent deadlock? $\_\_\_\_\_.$

A$.$ mutual exclusion

B$.$ no pre$-$emption

C$.$ circular wait

D$.$ none of the above