first four

1. [42 pointa) Fillin each void entry on the left with Tif the right statement is true, or F otherwise -() A system call typically involves a software interrupt (trap). () Always during a context-switch, the OS swaps a process to disk and another process back into memory ) In SJF scheduling algorithm, moving a short process before a long one increases the waiting time of the short process. ()Process starvation problem can be addressed by round Robin scheduling algorithm. C) In multilevel feedback queue scheduling algorithm, the processes that do not use a lot of CPU time wils be moved to the lower-priority queue T?D () Dispatcher module gives control of the CPU to the process selected by the long- term scheduler CPU scheduler selects one from among the processes in the l'O queue to be executed (T) Processor cannot be interrupted while executing TestAndSet instruction. Register values are shared across threads in a multithreaded process. If wait and signal) semaphore operations are exccuted atomically, then mutual exclusion may be violated. ) One-to-one thred model can be used in parallel processing system When only the eircular wait condition is not hold, system will be in deadlock condition Usiog prionty algorthm in CPU scheduling could result in process starvation condiion ixed pruority preemptive schesduling is used in the mlbilevel goeue system