$(8)[2\%]$ If an instruction modifies several different locations, a page fault can be handled by

$($a$).$ using temporary registers to hold the values of overwritten locations.

$($b$).$ loading multiple pages in advance.

$($c$).$ incorporating special hardware.

$($d$).$ terminating the process.

$(9)[2\%]$ When the state for a dispatcher object moves to signaled, the Windows kernel

$($a$).$ moves all threads waiting on that object to ready state if the dispatcher object is a mutex object.

$($b$).$ moves a fixed number of threads $($possibly greater than one$)$ waiting on that object to ready state if the

dispatcher object is a mutex object.

$($c$).$ moves all threads waiting on that object to ready state if the dispatcher object is an event object.

$($d$).$ moves a fixed number of threads $($possibly greater than one$)$ waiting on that object to ready state if the

dispatcher object is an event object.

$(10)[2\%]$ Which of the following statements is not true about spinlocks in Linux?

$($a$).$ Spinlocks cannot be used on single processor machines.

$($b$).$ A thread may disable kernel preemption on Symmetric Multi Processing machines instead of acquiring

spinlocks.

$($c$).$ A thread that acquires a spinlock cannot acquire the same lock a second time without first releasing the lock.

$($d$).$ The Linux kernel is designed so that the spinlock is held only for only short durations.