adplus-dvertising
frame-decoration

Question

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

a.

Semaphore

b.

Mutual exclusion

c.

Multiprogramming

d.

Message passing

Answer: (b).Mutual exclusion

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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.

Q. A program is located in the smallest available hole in the memory is ……………

Q. With a four programs in memory and with 80% average I/O wait, the CPU utilization is?

Q. Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is:

Q. Suppose it takes 100 ns to access a page table and 20 ns to access associative memory with a 90% hit rate, the average access time equals: