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