adplus-dvertising
frame-decoration

Question

Dijkestra banking algorithm in an operating system, solves the problem of

a.

deadlock avoidance

b.

deadlock recovery

c.

mutual exclusion

d.

context switching

Answer: (a).deadlock avoidance

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Dijkestra banking algorithm in an operating system, solves the problem of

Similar Questions

Discover Related MCQs

Q. The multiuser operating system, 20 requests are made to use a particular resource per hour, on an average the probability that no request are made in 45 minutes is

Q. The maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads)

Q. A file organization component VSAM file is

Q. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as

Q. How many states can a process be in ?

Q. Virtual memory is

Q. Optical storage is a

Q. WINDOWS is a …………… operating.

Q. Page making process from main memory to disk is called

Q. A Dead-lock in an Operating System is

Q. Match the following:

Set-I
(a) Disk scheduling
(b) Batch processing
(c) Time sharing
(d) Interrupt processing

Set-II
1. Round-robin
2. SCAN
3. LIFO
4. FIFO

Codes :
    (a) (b) (c) (d)

Q. ………….. synchronizes critical resources to prevent dead lock.

Q. …………….. is one of pre-emptive scheduling algorithm.

Q. In order to allow only one process to enter its critical section, binary semaphore are initialized to

Q. Remote Computing Service involves the use of time sharing and …………..

Q. Applications-software

Q. At any given time Parallel Virtual Machine (PVM) has ……………. send buffer and …………… receive buffer.

Q. In the process management Round-robin method is essentially the pre-emptive version of …………

Q. A page fault

Q. A semaphore count of negative n means (s = –n) that the queue contains ………….. waiting processes.