Question Detail

Dijkstra's algorithm deals with

mutual exclusion
deadlock recovery
deadlock avoidance
cache coherence

Answer: Option C

Similar Questions :

1. Which of the following does not interrupt an running process

A device
Timer
Schedular Process
Power failure

Answer: Option C

2. Disk scheduling includes deciding

which should be accessed next
order in which disk access requests must be serviced
the physical location of the file
the logical location of the file

Answer: Option B

3. For multiprogramming operating system

special support from processor is essential
special support from processor is not essential
cache memory is essential
none of above

Answer: Option B

4. A public key encryption system

Allows only the correct sender to decode the data
Allows only the correct receiver to decode the data
Allows anyone to decode the data
none of above

Answer: Option B

5. Which of following is not a condition of Dead Lock ?

Mutual Exclusion
No Preemption
Hold and Wait
Data Transfer

Answer: Option D

Read more from - Operating System Questions Answers - Chapter 1