…………… is a condition in which there is a set of concurrent processes, only one of which is able to access a given resource or perform a given function at any time. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

…………… is a condition in which there is a set of concurrent processes, only one of which is able to  access a given resource or perform a given function at any time.
A) Mutual Exclusion
B) Busy Waiting
C) Deadlock
D) Starvation
by

1 Answer

Answer :

A) Mutual Exclusion
by

Related questions

………………. Techniques can be used to resolve conflicts, such as competition for resources, and to synchronize processes so that they can cooperate. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Description : ………………. Techniques can be used to resolve conflicts, such as competition for resources, and to synchronize processes so that they can cooperate. A) Mutual Exclusion B) Busy Waiting C) Deadlock D) Starvation

Last Answer : A) Mutual Exclusion

……………. Can be defined as the permanent blocking of a set of processed that either complete for system resources or communicate with each other. A) Deadlock B) Permanent lock C) Starvation D) Mutual exclusion

Description : ……………. Can be defined as the permanent blocking of a set of processed that either complete for system resources or communicate with each other. A) Deadlock B) Permanent lock C) Starvation D) Mutual exclusion

Last Answer : A) Deadlock

.............. refers to a situation in which a process is ready to execute but is continuously denied access to a processor in deference to other processes. A) Synchronization B) Mutual Exclusion C) Dead lock D) Starvation

Description : .............. refers to a situation in which a process is ready to execute but is continuously denied access to a processor in deference to other processes. A) Synchronization B) Mutual Exclusion C) Dead lock D) Starvation

Last Answer : D) Starvation

Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use a resource at a time. A) i-a, ii-b, iii-c B) i-a, ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b

Description : Match the following. i) Mutual exclusion a) A process may hold allocated resources while waiting assignment. ii) Hold and wait b) No resource can be forcibly removed from a process holding it. iii) No preemption c) Only one process may use ... , ii-c, iii-b C) i-b, ii-c, iii-a D) i-c, ii-a, iii-b

Last Answer : D) i-c, ii-a, iii-b

The following conditions of policy must be present for a deadlock to be possible. i) Mutual exclusion ii) Hold and wait iii) No preemption iv) Circular wait A) i, ii and iii only B) ii, iii and iv only C) i, iii and iv only D) All i, ii, iii and iv

Description : The following conditions of policy must be present for a deadlock to be possible. i) Mutual exclusion ii) Hold and wait iii) No preemption iv) Circular wait A) i, ii and iii only B) ii, iii and iv only C) i, iii and iv only D) All i, ii, iii and iv

Last Answer : D) All i, ii, iii and iv

A direct method of deadlock prevention is to prevent the occurrence of ………….. A) Mutual exclusion B) Hold and wait C) Circular waits D) No preemption

Description : A direct method of deadlock prevention is to prevent the occurrence of ………….. A) Mutual exclusion B) Hold and wait C) Circular waits D) No preemption

Last Answer : C) Circular waits

A direct method of deadlock prevention is to prevent the occurrences of ................... A) Mutual exclusion B) Hold and wait C) Circular waits D) No preemption

Description : A direct method of deadlock prevention is to prevent the occurrences of ................... A) Mutual exclusion B) Hold and wait C) Circular waits D) No preemption

Last Answer : C) Circular waits

................ is the ability of multiple process to co-ordinate their activities by exchange of information A) Synchronization B) Mutual Exclusion C) Dead lock D) Starvation

Description : ................ is the ability of multiple process to co-ordinate their activities by exchange of information A) Synchronization B) Mutual Exclusion C) Dead lock D) Starvation

Last Answer : A) Synchronization

Which are the condition that should be met in order to produce a deadlock. a. Mutual exclusion b. Hold and Wait Cc. No preemption d. Circular wait e. Allofthese

Description : Which are the condition that should be met in order to produce a deadlock. a. Mutual exclusion b. Hold and Wait Cc. No preemption d. Circular wait e. Allofthese

Last Answer : e. Allofthese

Simplest way of deadlock recovery is (A) Roll back (B) Preempt resource (C) Lock one of the processes (D) Kill one of the processes

Description : Simplest way of deadlock recovery is (A) Roll back (B) Preempt resource (C) Lock one of the processes (D) Kill one of the processes

Last Answer : (D) Kill one of the processes

Necessary conditions for deadlock are: a) Non preemptive and circular wait b) Mutual exclusion and partial allocation c) Both of The Above d) None of The Above

Description : Necessary conditions for deadlock are: a) Non preemptive and circular wait b) Mutual exclusion and partial allocation c) Both of The Above d) None of The Above

Last Answer : b) are privileged calls that are used to perform resource management functions, which are controlled by the operating system

There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order: (a) P2 needs to access (b) P1 needs to access (c) P3 needs to access (d) P2 exits critical section (e) Pi exits critical section The final value of semaphore will be: (1) 0 (2) 1 (3) -1 (4) -2

Description : There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access ... The final value of semaphore will be: (1) 0 (2) 1 (3) -1 (4) -2 

Last Answer : Answer: 1

A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Description : A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Last Answer : (C) medium term scheduling

Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Description : Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true? (A) R(Pi)∩W(Pj)=Φ (B) W(Pi)∩R(Pj)=Φ (C) R(Pi)∩R(Pj)=Φ (D) W(Pi)∩W(Pj)=Φ

Last Answer : (C) R(Pi)∩R(Pj)=Φ 

Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur? (A) 70 (B) 14 (C) 13 (D) 7

Description : Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur? (A) 70 (B) 14 (C) 13 (D) 7

Last Answer : (B) 14

Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is inexpensive to implement. (1) (A), (B) and (C) are false. (2) (A) and (B) false; (C) true. (3) (A) and (B) true; (C) false (4) (A) true; (B) and (C) are false

Description : Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)? (A) ERP automates and integrates majority of business processes. (B) ERP provides access to information in a Real Time Environment. (C) ERP is ... (A) and (B) true; (C) false (4) (A) true; (B) and (C) are false

Last Answer : Answer: 3

Mutual exclusion problem occurs between:a) processes that share resourcesb) processes that do not use the same resourcesc) two disjoint processes that do not interactd) None of The Above

Description : Mutual exclusion problem occurs between: a) processes that share resources b) processes that do not use the same resources c) two disjoint processes that do not interact d) None of The Above

Last Answer : a) processes that share resources

Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Description : Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine ... , system is in: (A) safe state (B) unsafe state (C) deadlocked state (D) starvation state

Last Answer : Answer: B

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Image With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Last Answer : (C) Yes, P4 P3 P1 P2

What is deadlock what is starvation How do they differ from each other?

Description : What is deadlock what is starvation How do they differ from each other?

Last Answer : A deadlock occurs when two (or more) threads have created a situation where they are all blocking each other. ... Starvation occurs when a scheduler process (i.e. the operating system) refuses to give a particular thread any quantity of a particular resource (generally CPU).

Which lock is more serious than indefinite postponement or starvation because it affect more than one job: a. Deadlock b. Spinelock c. Both d. None of these

Description : Which lock is more serious than indefinite postponement or starvation because it affect more than one job: a. Deadlock b. Spinelock c. Both d. None of these

Last Answer : a. Deadlock

Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock : I. 2-phase locking II. Time phase ordering (A) Both I & II (B) II only (C) I only (D) Neither I nor II

Description : Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock : I. 2-phase locking II. Time phase ordering (A) Both I & II (B) II only (C) I only (D) Neither I nor II

Last Answer : (B) II only

Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock ? (a) 2-phase Locking (b) Time stamp - ordering (A) Both (a) and (b) (B) (a) only (C) (b) only (D) Neither (a) nor (b)

Description : Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock ? (a) 2-phase Locking (b) Time stamp - ordering (A) Both (a) and (b) (B) (a) only (C) (b) only (D) Neither (a) nor (b)

Last Answer : (C) (b) only

………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

Description : ………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U and wants S & T process E holds T and wants V process F holds W and wants S process G holds V and wants U Is the system deadlocked ? If yes, ............. processes are deadlocked. (A) No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Description : Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U ... No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Last Answer : (C) Yes, D, E, G

Which of the following is not the approach to dealing with deadlock? A) Prevention B) Avoidance C) Detection D) Deletion

Description : Which of the following is not the approach to dealing with deadlock? A) Prevention B) Avoidance C) Detection D) Deletion

Last Answer : D) Deletion

emaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value: a. Mutex b. Mutual Cc. Memory d. __ Allof these

Description : emaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value: a. Mutex b. Mutual Cc. Memory d. __ Allof these

Last Answer : Mutex

Which are the characteristics of deadlocks. a. Mutual exclusion b. Hold and wait Cc. No pre-emption d. = Circular wait e. Allof these

Description : Which are the characteristics of deadlocks. a. Mutual exclusion b. Hold and wait Cc. No pre-emption d. = Circular wait e. Allof these

Last Answer : e. Allof these

Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a particular attribute (e.g. height-230 cm) (C) A thing that we wish to collect data about zero or more, possibly real world examples of it may exist. (D) A template for a group of things with the same set of characteristics that may exist in the real world

Description : Which of the following provides the best description of an entity type? (A) A specific concrete object with a defined set of processes (e.g. Jatin with diabetes) (B) A value given to a ... template for a group of things with the same set of characteristics that may exist in the real world

Last Answer : Answer: D

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Description : Which of the following scheduling algorithms may cause starvation? a. First-come-first-served b. Round Robin c. Priority d. Shortest process next e. Shortest remaining time first (1) a, c and e (2) c, d and e (3) b, d and e (4) b, c and d

Last Answer : Answer: 2

Dining Philosopher's problem is a: (A) Producer-Consumer problem (B) Classical IPC problem (C) Starvation problem (D) Synchronization primitive

Description : Dining Philosopher's problem is a: (A) Producer-Consumer problem (B) Classical IPC problem (C) Starvation problem (D) Synchronization primitive

Last Answer : (B) Classical IPC problem

Refers to a continuous tone generated in a local exchange terminal through a combination of two frequencies 350 Hz, and 440 Hz. A. Busy tone B. Call waiting tone C. Dial tone D. Standard tone

Description : Refers to a continuous tone generated in a local exchange terminal through a combination of two frequencies 350 Hz, and 440 Hz. A. Busy tone B. Call waiting tone C. Dial tone D. Standard tone

Last Answer : B. Call waiting tone

With ................ only one process can execute at a time; meanwhile all other process are waiting for the processer. With .............. more than one process can be running simultaneously each on a different processer. A) Multiprocessing, Multiprogramming B) Multiprogramming, Uniprocessing C) Multiprogramming, Multiprocessing D) Uniprogramming, Multiprocessing

Description : With ................ only one process can execute at a time; meanwhile all other process are waiting for the processer. With .............. more ... . A) Multiprocessing, Multiprogramming B) Multiprogramming, Uniprocessing C) Multiprogramming, Multiprocessing D) Uniprogramming, Multiprocessing

Last Answer : C) Multiprogramming, Multiprocessing

Carnivorous animals lions and leopards, occupy the same niche but lions predate mostly larger animals and leopards take smaller ones. This mechanism of competition is referred to as (a) character displacement (b) altruism (c) resource partitioning (d) competitive exclusion.

Description : Carnivorous animals lions and leopards, occupy the same niche but lions predate mostly larger animals and leopards take smaller ones. This mechanism of competition is referred to as (a) character displacement (b) altruism (c) resource partitioning (d) competitive exclusion.

Last Answer : (c) resource partitioning

Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it facilitates putting some set of processes into memory and a choice is made from that. IV. Because it does not allow to adjust the set of in-core processes. Which of the following is true ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Description : Consider the following justifications for commonly using the two-level CPU scheduling : I. It is used when memory is too small to hold all the ready processes. II. Because its performance is same as that of the FIFO. III. Because it ... ? (A) I, III and IV (B) I and II (C) III and IV (D) I and III

Last Answer : (D) I and III

The Network is overloaded with enormous data sent by many computers within the network. The inability of the network to deliver the data is termed as __________ . (1) Access control (2) Congestion (3) Error propagation (4) Deadlock

Description : The Network is overloaded with enormous data sent by many computers within the network. The inability of the network to deliver the data is termed as __________ . (1) Access control (2) Congestion (3) Error propagation (4) Deadlock

Last Answer : Congestion

How many condition that should be met in order to produce a deadlock. a. 2 b 4 Cc. 6 d 8

Description : How many condition that should be met in order to produce a deadlock. a. 2 b 4 Cc. 6 d 8

Last Answer : b 4

A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one element (s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Description : A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ (s1) δ(q, a, b) contains at most one ... ) must be empty for every c ∈ Σ (A) only s1 (B) only s2 (C) both s1 and s2 (D) neither s1 nor s2

Last Answer : (C) both s1 and s2

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < x < 5. (A) B, A, D, E, C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Description : Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < ... , C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Last Answer : (B) C, E, D, B, A

Possible thread states in Windows 2000 operating system include: (A) Ready, running and waiting (B) Ready, standby, running, waiting, transition and terminated. (C) Ready, running, waiting, transition and terminated (D) Standby, running, transition and terminated.

Description : Possible thread states in Windows 2000 operating system include: (A) Ready, running and waiting (B) Ready, standby, running, waiting, transition and terminated. (C) Ready, running, waiting, transition and terminated (D) Standby, running, transition and terminated.

Last Answer : (B) Ready, standby, running, waiting, transition and terminated.

A portion of the Polymorphic virus, generally called a …………………….. , creates, a random encryption, key to encrypt the remainder of the virus. A) mutual engine B) mutation engine C) multiple engine D) polymorphic engine

Description : A portion of the Polymorphic virus, generally called a …………………….. , creates, a random encryption, key to encrypt the remainder of the virus. A) mutual engine B) mutation engine C) multiple engine D) polymorphic engine

Last Answer : C) multiple engine

Based on the cardinality ratio and participation ............... associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design. (A) Entity (B) Constraints (C) Rules (D) Keys

Description : Based on the cardinality ratio and participation ............... associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design. (A) Entity (B) Constraints (C) Rules (D) Keys

Last Answer : (B) Constraints

State True or False. i) A satic function can have access to only other static members (functions or variables) declared in the same class. ii) A static member function can be called using the class name (instead of its objects) A) True, True B) True, False C) False, True D) False, False

Description : State True or False. i) A satic function can have access to only other static members (functions or variables) declared in the same class. ii) A static member function can be called using the class name (instead of its objects) A) True, True B) True, False C) False, True D) False, False

Last Answer : B) True, False

If a function is friend of a class, which one of the following is wrong ? (A) A function can only be declared a friend by a class itself. (B) Friend functions are not members of a class, they are associated with it. (C) Friend functions are members of a class. (D) It can have access to all members of the class, even private ones.

Description : If a function is friend of a class, which one of the following is wrong ? (A) A function can only be declared a friend by a class itself. (B) Friend functions are not members of a class, they are ... are members of a class. (D) It can have access to all members of the class, even private ones.

Last Answer : (C) Friend functions are members of a class.

Which of the following condition is true for an object used as a function argument. i) A copy of the entire objects is passed to the function. ii) Only the address of the object is transferred to the function. A) Only i B) Only ii C) Both i and ii D) None of them

Description : Which of the following condition is true for an object used as a function argument. i) A copy of the entire objects is passed to the function. ii) Only the address of the object is transferred to the function. A) Only i B) Only ii C) Both i and ii D) None of them

Last Answer : C) Both i and ii

Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further, Shx and Shy are shearing factors in x and y directions. If we perform the y-direction shear relative to x=xref then the transformed point is given by ............

Description : Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further, Shx and Shy are shearing factors in x and y directions. If we perform the y-direction shear relative to x=xref then the transformed point is given by ............ 

Last Answer : (C) x’ = x y’ = Shy(x - xref) + y