Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Multiple Choice Questions
Q791: Which of the following is NOT one of the three conditions required for deadlock to occur?
- A: Competition for non-sharable resources
- B: Partial resource requests
- C: Forcibly retrieving allocated resources
- D: Non-forcible retrieval of resources
View Answer
C
Q792: In a deadlock situation, if two processes are waiting for resources held by each other, which condition is being satisfied?
- A: Competition for non-sharable resources
- B: Partial resource requests
- C: Non-forcible retrieval of resources
- D: Mutual exclusion
View Answer
A
Q793: What is the purpose of deadlock detection and correction schemes?
- A: To detect and correct deadlock by forcibly retrieving some resources
- B: To prevent deadlock from occurring
- C: To avoid using non-sharable resources
- D: To avoid resource allocation issues
View Answer
B
Q794: How can a full process table cause a deadlock?
- A: By preventing any new processes from being created due to lack of space
- B: By creating too many processes in the system
- C: By reducing system performance significantly
- D: By overloading the process scheduler
View Answer
A
Q795: What technique involves making a non-sharable resource appear sharable by holding data for output until later?
- A: Spooling
- B: Deadlock detection
- C: Deadlock avoidance
- D: Process scheduling
View Answer
A
Q796: Which condition for deadlock is addressed by requiring each process to request all resources at one time?
- A: Partial resource requests
- B: Non-forcible retrieval of resources
- C: Competition for non-sharable resources
- D: Mutual exclusion
View Answer
A
Q797: How does spooling help in managing non-sharable resources?
- A: By holding data for output until the resource becomes available
- B: By sharing resources among multiple processes
- C: By forcibly retrieving resources from processes
- D: By allocating resources to processes in a sequential manner
View Answer
A
Q798: What is the technical term used for removing processes to break a deadlock in a full process table scenario?
- A: Killing
- B: Spooling
- C: Detecting
- D: Correcting
View Answer
A
Q799: Which of the following techniques converts non-sharable resources into sharable ones?
- A: Deadlock avoidance
- B: Deadlock detection
- C: Spooling
- D: Resource allocation management
View Answer
A
Q800: What condition for deadlock involves a process requesting additional resources after initially receiving some?
- A: Partial resource requests
- B: Competition for non-sharable resources
- C: Non-forcible retrieval of resources
- D: Mutual exclusion
View Answer
A