What is the primary goal of deadlock prevention?
To allow processes to complete without waiting
To detect deadlocks when they occur
To make it impossible for deadlocks to occur
To ensure system resources are freed
Why is Priority Scheduling susceptible to starvation?
All processes run indefinitely
It is based on the order of arrival
High-priority processes never yield the CPU
Lower priority processes are delayed indefinitely
Which of the following synchronization mechanisms is used to control access to a shared resource?
Semaphore
Thread Pool
NetBIOS
BFS
What is the optimal page replacement algorithm based on?
First in memory
Random choice
Least recently used pages
Future page requests
Which type of operating system is characterized by a single large program running in a single address space?
Monolithic
Microkernel
Modular
Layered
In which scenario would kernel-level thread management be most beneficial?
For I/O-bound applications
When a single-core CPU is used
For compute-bound applications
When minimal context switching is desired
Which of the following best defines a 'process' in an operating system?
A program in execution.
A file stored on disk.
A collection of data.
A sequence of commands.
What is the primary benefit of virtual memory?
Eliminates fragmentation completely
Allows processes to use more memory than physically available
Reduces physical memory usage
Increases the speed of RAM
In demand paging, when is a page brought into memory?
When the memory is initially allocated.
When a reference to the page is made.
When the system reaches a certain load.
When the page is allocated to a process.
What is the main disadvantage of the FIFO page replacement algorithm?
It is complex to implement in hardware
It may lead to thrashing due to frequent page changes
It requires making multiple passes through the memory
It can lead to high page faults with frequently used pages