Which classical synchronization problem involves managing a limited-size buffered resource shared between producer and consumer processes?
Sleeping Barber Problem
Bounded Buffer Problem
Readers-Writers Problem
Dining Philosophers Problem
Which resource is typically not virtualized?
Network bandwidth
Memory
Physical devices such as printers
CPU
What is a primary disadvantage of contiguous allocation?
Increased fragmentation
Complex access methods
High overhead for small files
Difficulty in resizing files
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 state where at least one process is executing.
A process holds a resource and is waiting for another resource.
All resources are held by processes.
Which file allocation method uses a single indexed structure to keep track of all file blocks?
Acyclic-Graph Allocation
Indexed Allocation
Contiguous Allocation
Linked Allocation
Which of the following statements about mutex locks is true?
They can be used for condition variables.
Only one thread can own a mutex lock at a time.
They can be locked multiple times by the same thread.
They enable multiple threads to access a resource simultaneously.
Which disk scheduling algorithm involves the disk arm moving towards the end of the disk before reversing direction?
SCAN
C-LOOK
LOOK
SSTF
Which disk scheduling algorithm guarantees that each request gets serviced and prevents starvation?
FCFS
C-SCAN
What is the purpose of file attributes in an operating system?
To compress files
To provide metadata about files
To execute files
To create backups
In multi-threading models, which model allows for the highest flexibility in mapping user threads to kernel threads?
Many-to-Many Model
Two-Level Model
One-to-One Model
Many-to-One Model