Which scheduling algorithm involves a fixed time quantum for processes to execute before being cycled out for the next process?
Round Robin
Shortest Job Next
First-Come, First-Served
Priority Scheduling
What is a primary advantage of using bitmaps for free space management in file systems?
Reduced memory footprint
Fixed allocation size
Fast allocation and deallocation
Increased complexity
In preemptive scheduling, what allows a higher-priority process to interrupt a lower-priority one?
Time quantum expiration
Process aging
Process blocking
Priority levels
In which memory allocation strategy does the system allocate memory in fixed-size blocks?
Paged allocation
Non-contiguous allocation
Contiguous allocation
Segmentation
What is a key feature of acyclic-graph directory structures?
Files are uniquely stored without redundancy
Files can have multiple parents
Files are stored in a single directory
All files must have one parent
Why is Priority Scheduling susceptible to starvation?
It is based on the order of arrival
All processes run indefinitely
Lower priority processes are delayed indefinitely
High-priority processes never yield the CPU
What does context switching refer to in operating systems?
Switching between different types of software.
Switching the process state from running to ready.
Saving and restoring process states.
Switching between different security levels.
In which process state is a process waiting for some event (like I/O completion)?
Blocked
Running
Ready
Terminated
What is a significant disadvantage of contiguous memory allocation?
It requires continuous allocation.
It leads to external fragmentation.
It complicates the memory management unit.
It is inefficient with large memory sizes.
Which of the following models exemplifies inter-process communication through shared memory?
Pipes
Mailboxes
Semaphores
Direct shared memory access.