adplus-dvertising
frame-decoration

Question

Consider a system with five processes P0 through P4 and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C has six instances suppose at time T0 we have the following allocation.
If we implement Deadlock detection algorithm we claim that system is ..................

a.

Semaphore

b.

Deadlock state

c.

Circular wait

d.

Not in deadlock state

Answer: (d).Not in deadlock state

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider a system with five processes P0 through P4 and three resource types A, B and C. Resource type A has seven instances, resource type B has two instances and resource type C...

Similar Questions

Discover Related MCQs

Q. Interrupts which are initiated by an instruction are

Q. Resources are allocated to the process on non-sharable basis is

Q. If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.

Q. Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K, and 426 K (in order), using the first-fit algorithm, in which partition would the process requiring 426 K be placed ?

Q. The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using :

Q. Which of the following memory allocation scheme suffers from external fragmentation ?

Q. Match the following :
List – I                                              List – II
a. Critical region                            1. Hoares Monitor
b. Wait/signal                                 2. Mutual exclusion
c. Working set                               3. Principal of locality
d. Dead lock                                  4. Circular wait

Codes : a b c d

Q. Which of the following features will characterize an OS as multiprogrammed OS ?

(a) More than one program may be loaded into main memory at the same time.
(b) If a program waits for certain event another program is immediately scheduled.
(c) If the execution of a program terminates, another program is immediately scheduled.

Q. A thread is a light weight process. In the above statement, weight refers to

Q. Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur ?

Q. Consider n processes sharing the CPU in round robin fashion. Assuming that each process switch takes s seconds. What must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the CPU at least every t seconds ? 

Q. The virtual address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB) can hold total 64 page table entries and  4-way set associative (i.e.with4-cache lines in the set). The page Sill' is 4 KB. The minimum size of TLB tag is

Q. Consider a disk queue with request for input/output to block on cylinders

98,183,37,122,14, 124, 65, 67 in that order

Assume that disk head is  initially positioned at cylinder 53  and moving towards cylinder number 0. The total number of head movements using Shortest Seek lime First (SSTF) and SCAN algorithms are respectively

Q. How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size

Q. Translation Look-aside Buffer (TLB) is

Q. Simplest way of deadlock recovery is

Q. Possible thread states in Windows 2000 operating system include

Q. Which of the following conditions does not hold good for a solution to a critical section problem?

Q. In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. If an empty frame is available or if the replaced page is not modified, and it takes 20 m.sec., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time?

Q. The directory can be viewed as _______ that translates filenames into their directory entries.