Computer Science - Operating Systems Concepts

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

Answer: Option A

Explanation:

No answer description available for this question. Let us discuss.

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

Answer: Option A

Explanation:

No answer description available for this question. Let us discuss.

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

Answer: Option D

Explanation:

No answer description available for this question. Let us discuss.

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

Answer: Option D

Explanation:

No answer description available for this question. Let us discuss.

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

Answer: Option B

Explanation:

Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes. It allows two threads to share a single-use resource without conflict, using only shared memory for communication.

It avoids the strict alternation of a naive turn-taking algorithm, and was one of the first mutual exclusion algorithms to be invented.

Source: http://en.wikipedia.org/wiki/Dekker's_algorithm