Operating Systems Concepts - Section 7 Multiple Questions and Answers.
Exercise Questions ::
Operating Systems
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 |
|
|
Published by:Michael Daani
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 |
|
|
Published by:Michael Daani
Published by:Michael Daani
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 |
|
|
Published by:Michael Daani
15. | The file structure that redefines its first record at a base of zero uses the term: |
| |
| A. | relative organization |
| B. | key fielding |
| C. | dynamic reallocation |
| D. | hashing |
|
|
Published by:Michael Daani
«»