resource allocation state

system storage state

operating system

resources

A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it

A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes

A process must hold at least one resource and not be waiting to acquire additional resources

None of the mentioned

at least one resource must be held in a non-sharable mode

the processor must be a uniprocessor rather than a multiprocessor

there must be at least one resource in a sharable mode

all of the mentioned

Mutual exclusion

No preemption

Hold and wait

All of the mentioned

deadlock

starvation

inversion

aging

every time a resource request is made

at fixed time intervals

every time a resource request is made at fixed time intervals

none of the mentioned

in advance processes rarely know that how much resource they will need

the number of processes changes as time progresses

resource once available can disappear

all of the mentioned

banker’s algorithm

round-robin algorithm

elevator algorithm

karn’s algorithm

defining a linear ordering of resource types

using thread

using pipes

all of the mentioned

the system can allocate resources to each process in some order and still avoid a deadlock

there exist a safe sequence

all of the mentioned

none of the mentioned

mutual exclusion

a process may hold allocated resources while awaiting assignment of other resources

no resource can be forcibly removed from a process holding it

all of the mentioned

remainder section code

non – critical section code

critical section code

none of the mentioned

continue()

wakeup()

getup()

start()

stop()

block()

hold()

wait()

its magnitude is the number of processes waiting on that semaphore

it is invalid

no operation can be further performed on it until the signal operation is performed on it

none of the mentioned