In the context of the critical section problem, which of the following conditions must be avoided to prevent deadlock?
Circular wait
No preemption
Hold and wait
Mutual exclusion
In Multilevel Feedback Queue Scheduling, what criteria determines how a process is moved between queues?
The priority level of the process.
The remaining burst time of the process.
Arrival time of the process.
Based on the execution time slice utilized by the process.
What advantage does virtual memory provide over conventional memory assembly?
Improves cache performance
Increased memory speed
Allows programs larger than physical memory
Reduces page faults
Which of the following is a downside of using containers compared to virtual machines?
Less efficient resource management
Increased security risks due to sharing the host OS kernel
Limited scalability
Higher resource overhead
Which of the following is an example of a multithreading issue that can lead to deadlock?
An improper context switch.
A thread being starved of resources.
Two threads waiting for each other to release resources.
A thread exceeding its time slice.
Which disk scheduling algorithm involves the disk arm moving towards the end of the disk before reversing direction?
C-LOOK
SCAN
SSTF
LOOK
Which of the following is a major benefit of using caching in an operating system?
Simplified I/O operations
Reduced latency for frequently accessed data
Increased disk space
Elimination of data redundancy
What is a race condition?
An event that describes deadlock occurrences.
A scenario where the outcome depends on the order of execution.
A situation where two or more processes execute simultaneously.
A conflict arising due to resource allocation.
Which scheduling algorithm allows processes to share CPU time fairly?
Priority Scheduling
First-Come, First-Served
Shortest Job First
Round Robin
Which of the following is a method for achieving file system consistency after a crash?
Journaling
Disk Striping
Caching
Data Replication