adplus-dvertising
frame-decoration

Question

Dijkstra's algorithm deals with

a.

mutual exclusion

b.

deadlock recovery

c.

deadlock avoidance

d.

cache coherence

Posted under Operating System

Answer: (c).deadlock avoidance

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Dijkstra's algorithm deals with

Similar Questions

Discover Related MCQs

Q. Daisy chain is a device for

Q. A series of statements explaining how the data is to be processed is called

Q. A hardware device which is capable of executing a sequence of instructions, is known as

Q. With multiprogramming, ______ is used productively.

Q. What must reside in the main memory under all situations in a resident - OS computer?

Q. Where does a computer add and compare data?

Q. Which of the following is correct regarding operating system?

Q. The main function of the command interpreter is

Q. The procedure of starting a computer by loading the kernel is known as

Q. Shell is the exclusive feature of which software?

Q. The address generated by the CPU is referred to as:

Q. Which of the following scheduling algorithm is non-preemptive?

Q. What will a simple two pass assembler do in the first pass?

Q. Your system response time is very poor. What may be the reason?

Q. The volatile storage is/are

Q. Which of the following loader is executed when a system is first turned on or restarted

Q. The first batch operating system was developed in the ................. by General Motors for use on an
IBM 701.

Q. ................... is a facility that allows programmers to address memory from a logical point of view, without regard to the main memory, physically available.

Q. ............ is a large kernel, including scheduling file system, networking, device drivers, memory management and more.

Q. A .................... architecture assigns only a few essential functions to the kernel, including address
spaces, Inter process communication (IPC) and basic scheduling.