Which one of the following definitions applies to a deadlock?
A state in which two or more processes are unable to proceed because each is waiting for the other to release a resource.
A process holds a resource and is waiting for another resource.
A state where at least one process is executing.
All resources are held by processes.
In a paging system, what is the primary purpose of the page table?
To allocate CPU time
To hold data temporarily during execution
To manage I/O operations
To translate logical addresses to physical addresses
Which scheduling algorithm allows processes to share CPU time fairly?
Priority Scheduling
Shortest Job First
Round Robin
First-Come, First-Served
Which of the following is true regarding process synchronization?
Is unnecessary in single-threaded applications
It helps prevent race conditions
Eliminates the need for semaphores
Only applicable in shared memory IPC
Which disk scheduling algorithm guarantees that each request gets serviced and prevents starvation?
C-SCAN
LOOK
FCFS
SSTF
Which of the following is a characteristic of Type 1 hypervisors?
They are more efficient than Type 2 hypervisors
They require significant hardware resources
They can only support one virtual machine at a time
They run on top of a host operating system
Which method is not typically used for free space management?
Bitmaps
Arrays
Grouping
Linked Lists
Which method aims to manage resources so that deadlocks never occur?
Deadlock detection
Deadlock prevention
Deadlock recovery
Deadlock avoidance
In the context of virtualization, what function does a hypervisor serve?
Manage virtual machines
Monitor system bandwidth
Control physical device drivers
Optimize disk storage
What does context switching involve?
Saving and loading the state of a thread.
Switching between different operating systems.
Changing the priority of a thread.
Switching from user mode to kernel mode.