1) Process scheduling algorithms affect: a) CPU time required for execution b) Waiting time in READY queue c) Input/Output operations time d) Memory management time e) Context switch time 2) To prevent a deadlock we need: a) To use only non-preemptive process scheduling b) To use only preemptive process scheduling c) To avoid thrashing in memory management d) To break the sufficient condition of a deadlock e) To break any necessary condition of a deadlock 3) The disadvantage of the Banker's algorithm is: a) Can lead to a deadlock b) Can be used only in 1-processor system c) Can be used only with resources in main memory d) We need to run Banker's algorithm after any request for any resource from any job e) Can be used only for financial applications