.............. 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

.............. 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
by

1 Answer

Answer :

D) Starvation
by

Related questions

................ 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

…………… 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

Description : …………… 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

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

………………. 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

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

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

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

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

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 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

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

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

Some of the criteria for calculation of priority of a process are: a. Processor utilization by an individual process. b. Weight assigned to a user or group of users. c. Processor utilization by a user or group of processes. In fair share scheduler, priority is calculated based on: (1) only (a) and (b) (2) only (a) and (c) (3) (a), (b) and (c) (4) only (b) and (c)

Description : Some of the criteria for calculation of priority of a process are: a. Processor utilization by an individual process. b. Weight assigned to a user or group of users. c. Processor utilization by a user or group of processes. In fair share ... (a) and (c) (3) (a), (b) and (c) (4) only (b) and (c)

Last Answer : (3) (a), (b) and (c)

In process scheduling, ………………… determines which ready process will be executed next by processor. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Description : In process scheduling, ………………… determines which ready process will be executed next by processor. A) long term scheduling B) medium term scheduling C) short term scheduling D) none of the above

Last Answer : C) short term scheduling

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

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) Processes are permanently assigned to a queue (D) This algorithm can be configured to match a specific system under design

Description : Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm? (A) Queues have different priorities. (B) Each queue may have different scheduling algorithm (C) ... to a queue (D) This algorithm can be configured to match a specific system under design

Last Answer : (C) Processes are permanently assigned to a queue

Which of the following refers to a management tool for organizing personnel, facilities, equipment, and communication for any emergency situation? a) The Incident Command System The Incident Command System (ICS) is a management tool for organizing personnel, facilities, equipment and communication for any emergency situation. The federal government mandates that the ICS be used during emergencies. Under this structure, one person is designated as incident commander. This person must be continuously informed of all activities and informed about any deviation from the established plan. While the ICS is primarily a field structure and process, aspects of it are used at the level of an individual hospital’s emergency response plan as well.

Description : Which of the following refers to a management tool for organizing personnel, facilities, equipment, and communication for any emergency situation? a) The Incident Command System The ... emergency preparedness required by the Joint Commission on Accreditation of Healthcare Organizations (JCAHO).

Last Answer : a) The Incident Command System The Incident Command System (ICS) is a management tool for organizing personnel, facilities, equipment and communication for any emergency situation. The federal government mandates ... are used at the level of an individual hospital's emergency response plan as well.

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

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

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

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

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 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

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

A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Description : A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Last Answer : C) real memory, virtual memory

.................. executes must frequently and makes the fine grained decision of which process to execute the next. A) Long-term scheduling B) Medium-term scheduling C) Short-term scheduling D) None of the above

Description : .................. executes must frequently and makes the fine grained decision of which process to execute the next. A) Long-term scheduling B) Medium-term scheduling C) Short-term scheduling D) None of the above

Last Answer : C) Short-term scheduling

Which lock can arise when two processes wait for phone calls from one another. a. Spine lock b. Dead lock c. Both d. None of these

Description : Which lock can arise when two processes wait for phone calls from one another. a. Spine lock b. Dead lock c. Both d. None of these

Last Answer : b. Dead lock

Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables

Description : Which is the main function of transport layer? A) Node to node delivery B) End to end delivery C) Synchronization d) Updating and maintaining routing tables

Last Answer : B) End to end delivery

Synchronization is achieved by a timing device called a ................. which generates a periodic train of .................. (A) clock generator, clock pulse (B) master generator, clock pulse (C) generator, clock (D) master clock generator, clock pulse

Description : Synchronization is achieved by a timing device called a ................. which generates a periodic train of .................. (A) clock generator, clock pulse (B) master generator, clock pulse (C) generator, clock (D) master clock generator, clock pulse

Last Answer : Answer: A and D

The start and stop bits are used in serial communication for (A) error detection (B) error correction (C) synchronization (D) slowing down the communication

Description : The start and stop bits are used in serial communication for (A) error detection (B) error correction (C) synchronization (D) slowing down the communication

Last Answer : (C) synchronization 

Which of the following is not associated with the session layer? (A) Dialog control (B) Token management (C) Semantics of the information transmitted (D) Synchronization

Description : Which of the following is not associated with the session layer? (A) Dialog control (B) Token management (C) Semantics of the information transmitted (D) Synchronization

Last Answer : (C) Semantics of the information transmitted 

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

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

___ Connection and the _______ instruction will solve the problem of synchronization between processor and coprocessor. a) INT & NMI, WAIT b) RQ/GT0 & RQ/GT1, FWAIT c) BUSY & TEST, FWAIT d) S0 & QS0, WAIT

Description : ___ Connection and the _______ instruction will solve the problem of synchronization between processor and coprocessor. a) INT & NMI, WAIT b) RQ/GT0 & RQ/GT1, FWAIT c) BUSY & TEST, FWAIT d) S0 & QS0, WAIT

Last Answer : b) RQ/GT0 & RQ/GT1, FWAIT

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 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.

is there a technical deference between addiction, desire, and habit?

Description : is there a technical deference between addiction, desire, and habit?

Last Answer : sorry this should read, “is there a technical difference between addiction, desire, and habit?”

Preparedstatement Object in JDBC is used to execute ........................... queries. A) executable B) simple C) high level D) parameterized

Description : Preparedstatement Object in JDBC is used to execute ........................... queries. A) executable B) simple C) high level D) parameterized

Last Answer : D) parameterized

Prepared Statement object in JDBC used to execute........... queries. A) Executable B) Simple C) High level D) Parameterized

Description : Prepared Statement object in JDBC used to execute........... queries. A) Executable B) Simple C) High level D) Parameterized

Last Answer : D) Parameterized

Which method will a web browser call on a new applet? A) main method B) destroy method C) execute method D) init method

Description : Which method will a web browser call on a new applet? A) main method B) destroy method C) execute method D) init method

Last Answer : D) init method

How many times does the following code segment execute int x=1, y=10, z=1; do{y--; x++; y-=2; y=z; z++} while (y>1 && z<10); A) 1 B) 10 C) 5 D) infinite

Description : How many times does the following code segment execute int x=1, y=10, z=1; do{y--; x++; y-=2; y=z; z++} while (y>1 && z

Last Answer : A) 1

The command javac is used to A) debug a java program B) compile a java program C) interpret a java program D) execute a java program

Description : The command javac is used to A) debug a java program B) compile a java program C) interpret a java program D) execute a java program

Last Answer : B) compile a java program

The type(s) of auto executing macros, in Microsoft word is/are A) Auto execute B) Auto macro C) Command macro D) All of the above

Description : The type(s) of auto executing macros, in Microsoft word is/are A) Auto execute B) Auto macro C) Command macro D) All of the above

Last Answer : D) All of the above

What is the output when we execute list(“hello”)? a) [‘h’, ‘e’, ‘l’, ‘l’, ‘o’]. b) [‘hello’]. c) [‘llo’]. d) [‘olleh’].

Description : What is the output when we execute list(“hello”)? a) [‘h’, ‘e’, ‘l’, ‘l’, ‘o’]. b) [‘hello’]. c) [‘llo’]. d) [‘olleh’].

Last Answer : a) [‘h’, ‘e’, ‘l’, ‘l’, ‘o’].

A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Description : A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is  P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Last Answer : (A) Pi || Pj for all i ≠ j Explanation: Bernstein's Condition: 1. If process Pi writes to a memory cell Mi, then no process Pj can read the cell Mi. 2. If process Pi read from a memory ... Mi. 3. If process Pi writes to a memory cell Mi, then no process Pj can write to the cell Mi.

Debugger is a program that (A) allows to examine and modify the contents of registers (B) does not allow execution of a segment of program (C) allows to set breakpoints, execute a segment of program and display contents of register (D) All of the above

Description : Debugger is a program that (A) allows to examine and modify the contents of registers (B) does not allow execution of a segment of program (C) allows to set breakpoints, execute a segment of program and display contents of register (D) All of the above

Last Answer : (C) allows to set breakpoints, execute a segment of program and display contents of register

In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager

Description : In windows 2000 operating system all the processor-dependent code is isolated in a dynamic link library called (A) NTFS file system (B) Hardware abstraction layer (C) Microkernel (D) Process Manager

Last Answer : (B) Hardware abstraction layer