Process Management in Operating Systems – 30 Intermediate MCQs
Questions: 30
Questions
-
1. Which of the following is a CPU scheduling algorithm?
- a) First-Come-First-Serve (FCFS)
- b) Round-Robin (RR)
- c) Shortest Job Next (SJN)
- d) All of the above
-
2. What is the primary goal of process scheduling?
- a) To ensure that all processes run simultaneously
- b) To maximize CPU utilization and system efficiency
- c) To minimize system boot time
- d) To allocate memory effectively
-
3. Which of these algorithms is preemptive?
- a) First-Come-First-Serve (FCFS)
- b) Shortest Job Next (SJN)
- c) Priority Scheduling
- d) Round-Robin (RR)
-
4. What is the term for the process of switching the CPU from one process to another?
- a) Process Switching
- b) Task Scheduling
- c) Context Switching
- d) Memory Mapping
-
5. Which condition must be satisfied for a deadlock to occur?
- a) Mutual exclusion
- b) Hold and wait
- c) Circular wait
- d) All of the above
-
6. What is the banker’s algorithm used for?
- a) CPU Scheduling
- b) Disk Scheduling
- c) Deadlock Avoidance
- d) Memory Management
-
7. What does the term "critical section" refer to in process synchronization?
- a) A region of code that only one process can execute at a time
- b) A code section that terminates all processes
- c) A scheduling algorithm for critical tasks
- d) A portion of memory shared between all processes
-
8. Which of the following is NOT a process synchronization technique?
- a) Semaphore
- b) Mutex
- c) Monitor
- d) Compiler
-
9. What is the primary issue addressed by the producer-consumer problem?
- a) Deadlocks in processes
- b) Buffer synchronization between producing and consuming processes
- c) Process scheduling conflicts
- d) Allocation of memory blocks
-
10. What is the purpose of a semaphore in process synchronization?
- a) To allocate memory blocks
- b) To prevent unauthorized access
- c) To control access to shared resources
- d) To monitor CPU utilization
-
11. Which of the following is a non-preemptive scheduling algorithm?
- a) Round-Robin
- b) Priority Scheduling
- c) Shortest Job First (SJF)
- d) All of the above
-
12. What is the result of a race condition in process management?
- a) Incorrect or unpredictable behavior due to processes accessing shared resources
- b) Improved CPU performance
- c) Efficient resource allocation
- d) Reduced waiting time
-
13. What is the key purpose of an OS implementing process synchronization?
- a) To manage memory allocation
- b) To prevent processes from accessing shared resources simultaneously
- c) To increase process execution speed
- d) To improve CPU scheduling
-
14. What is a ready queue in process management?
- a) A queue for processes waiting to be allocated to a device
- b) A queue for processes waiting to execute
- c) A queue for terminated processes
- d) A queue for processes waiting to access memory
-
15. What happens when a process requests resources in the deadlock prevention approach?
- a) It is blocked until the resource is available
- b) The OS checks for safe states before allocation
- c) It is terminated if resources are unavailable
- d) None of the above
-
16. Which scheduling algorithm results in a convoy effect?
- a) Round-Robin
- b) First-Come-First-Serve (FCFS)
- c) Shortest Job First (SJF)
- d) Priority Scheduling
-
17. What does "aging" refer to in priority scheduling?
- a) Reducing the priority of processes over time
- b) Increasing the priority of waiting processes over time
- c) Balancing CPU time among processes
- d) Allocating memory to processes
-
18. What is a thread in an operating system?
- a) A unit of execution within a process
- b) A type of memory allocation
- c) A resource management tool
- d) A file handling mechanism
-
19. Which mechanism is commonly used for inter-thread communication?
- a) Mutexes
- b) Semaphores
- c) Both A and B
- d) None of the above
-
20. Which term describes a situation where higher-priority processes starve lower-priority processes?
- a) Starvation
- b) Deadlock
- c) Aging
- d) Blocking
-
21. What is the main benefit of multi-threading?
- a) Reduced hardware usage
- b) Better CPU utilization and responsiveness
- c) Minimized resource allocation
- d) Simplified process management
-
22. What does the "wait" state indicate in a process lifecycle?
- a) The process is ready to execute
- b) The process is executing in the CPU
- c) The process is waiting for an event or resource
- d) The process has completed execution
-
23. Which condition in a deadlock refers to processes holding resources while waiting for additional resources?
- a) Mutual Exclusion
- b) Hold and Wait
- c) No Preemption
- d) Circular Wait
-
24. What is the primary purpose of a process scheduler?
- a) To allocate memory to processes
- b) To manage I/O operations
- c) To select processes for execution by the CPU
- d) To manage system resources
-
25. Which process state transition occurs when an I/O event is completed?
- a) Ready to Running
- b) Running to Waiting
- c) Waiting to Ready
- d) Terminated to New
-
26. What does a context switch involve?
- a) Transferring control between user and kernel modes
- b) Switching the CPU from one process to another
- c) Allocating resources to a process
- d) Terminating a process
-
27. What type of scheduling is used in operating systems like Unix for time-sharing systems?
- a) First-Come-First-Serve (FCFS)
- b) Shortest Job First (SJF)
- c) Round-Robin (RR)
- d) Priority Scheduling
-
28. What is a safe state in deadlock avoidance?
- a) A state where processes are terminated to avoid deadlock
- b) A state where resources can be allocated without causing a deadlock
- c) A state where all processes are blocked
- d) A state with minimal CPU utilization
-
29. Which synchronization problem arises when two processes wait indefinitely for each other to release a resource?
- a) Starvation
- b) Deadlock
- c) Race Condition
- d) Priority Inversion
-
30. What is the main goal of priority inversion avoidance mechanisms?
- a) To reduce the waiting time of high-priority processes
- b) To avoid deadlocks in the system
- c) To allow processes to execute simultaneously
- d) To ensure all processes are allocated equal CPU time
Ready to put your knowledge to the test? Take this exam and evaluate your understanding of the subject.
Start Exam