11. Which of the following statements is false?
A. a process scheduling algorithm is preemptive if the CPU can be forcibly removed from a process
B. time sharing systems generally use preemptive CPU scheduling
C. response time are more predictable in preemptive systems than in non preemptive systems
D. real time systems generally use non-preemptive CPU scheduling
E. None of the above
12. Nonmodifiable procedures are called
A. serially usable procedures
B. concurrent procedures
C. reentrant procedures
D. topdown procedures
E. None of the above
13. The instruction register
A. is a hardware memory device which denotes the location of the current instruction being executed.
B. is a group of electrical circuits (hardware), that performs the intent of instructions fetched from memory.
C. contains the address of the memory location that is to be read from or stored into.
D. contains a copy of the designated memory location specified by the MAR after a “read” or the new contents of the memory prior to a “write”.
E. None of the above
14. Which of the following scheduling objectives should be applied to the following: the system should admit jobs to create a mix that will keep most devices busy
A. to be fair
B. to balance resource utilization
C. to obey priorities
D. to be predictable
E. None of the above
15. Multiprogramming systems:
A. are easier to develop than single programming system
B. execute each job faster
C. execute more jobs in the same time period
D. are used only on large mainframe computers
E. None of the above