11. Scheduling is

A. allowing jobs to use the processor
B. unrelated to performance consideration
C. not required in uniprocessor systems
D. the same regard-less of the purpose of the system
E. None of the above

12. What scheduling algorithm allows processes that are logical runnable to be temporarily suspended?

A. preemptive scheduling
B. non-preemptive scheduling
C. FIFO
D. FCFS
E. None of the above

13. In an absolute loading scheme, which loader function is accomplished by loader

A. Reallocation
B. Allocation
C. Linking
D. Loading
E. None of the above

14. The computational technique used to compute the disk storage address of individual records is called:

A. bubble memory
B. key fielding
C. dynamic reallocation
D. hashing
E. None of the above

15. For how many processes which are sharing common data, the Dekker’s algorithm implements mutual exclusion?

A. 1
B. 2
C. 3
D. 4
E. None of the above