NSCT – Deadlocks MCQs 20 min Score: 0 Attempted: 0/20 Subscribe 1. . A deadlock is a situation where: (A) Processes execute normally (B) Files are deleted (C) CPU runs faster (D) Two or more processes wait indefinitely for resourcesShow All Answers 2. . Deadlock occurs when processes: (A) Share memory (B) Finish execution quickly (C) Compete for resources and wait for each other (D) Use only CPU 3. . Which of the following is a necessary condition for deadlock? (A) Mutual exclusion (B) Hold and wait (C) Circular wait (D) All of the above 4. . Mutual exclusion means: (A) Resources are shared freely (B) Only one process can use a resource at a time (C) All processes use resources together (D) CPU runs multiple programs 5. . Hold and wait condition means: (A) CPU stops working (B) A process releases all resources (C) A process finishes execution (D) A process holds a resource while waiting for another 6. . No preemption means: (A) CPU stops execution (B) Resources are shared by all processes (C) Resources cannot be taken from a process forcibly (D) Memory is deleted 7. . Circular wait occurs when: (A) CPU runs in a loop (B) Processes form a circular chain waiting for resources (C) Memory is full (D) Files are deleted 8. . Deadlock prevention works by: (A) Breaking at least one of the deadlock conditions (B) Increasing CPU speed (C) Deleting processes (D) Increasing memory size 9. . Deadlock avoidance requires: (A) Deleting files (B) Information about future resource requests (C) Faster CPU (D) More users 10. . Which algorithm is used for deadlock avoidance? (A) Round Robin (B) FCFS (C) Bankerās Algorithm (D) SJF 11. . Deadlock detection means: (A) Preventing deadlock (B) Deleting all processes (C) Identifying deadlock after it occurs (D) Restarting the computer 12. . Recovery from deadlock may involve: (A) Terminating processes (B) Preempting resources (C) All of the above (D) Rolling back processes 13. . The Bankerās Algorithm is used to: (A) Avoid deadlock (B) Prevent deadlock (C) Detect deadlock (D) Remove deadlock 14. . A system is in a safe state if: (A) No processes exist (B) Deadlock has already occurred (C) CPU is idle (D) Resources can be allocated safely to all processes 15. . Deadlock mainly occurs in: (A) Systems with multiple processes and shared resources (B) Single process systems (C) Systems without memory (D) Systems without CPU 16. . Deadlock prevention focuses on: (A) Increasing CPU speed (B) Increasing memory (C) Removing necessary conditions for deadlock (D) Deleting files 17. . Deadlock avoidance ensures that: (A) System always remains in a safe state (B) CPU stops execution (C) Files are deleted (D) Memory is full 18. . Deadlock detection algorithms check: (A) CPU speed (B) File system (C) Resource allocation graph (D) Network cables 19. . Which of the following is NOT a deadlock condition? (A) Mutual exclusion (B) Hold and wait (C) Circular wait (D) Preemption allowed 20. . The main goal of deadlock handling is to: (A) Increase CPU temperature (B) Increase monitor size (C) Delete processes (D) Prevent or manage deadlocks in a system
