Wiley Edge OS & Networking Quiz 3

FCFS scheduling gives priority to the process that arrives first and lets it run until it finishes before scheduling the next process.

Thread synchronization mechanisms are used to prevent data inconsistencies and race conditions when multiple threads access shared memory concurrently.

A Mutex (short for Mutual Exclusion) allows one thread to acquire and hold a lock while other threads wait for it to release the lock.

The "Waiting" state denotes a process that has temporarily stopped while it waits for an event to occur or for a resource to become available.

Priority Scheduling can lead to starvation if higher-priority processes continuously preempt lower-priority processes, causing them to never execute.

Segmentation allows for efficient memory utilization but can suffer from external fragmentation, where free memory is fragmented into small, non-contiguous blocks.

LRU replaces the page that has not been used for the longest period, making it a good choice for minimizing page faults.

The main drawback of FIFO is that it might not always offer the optimum option for page replacement, which can sometimes result in subpar performance.

The Worst Fit memory allocation strategy assigns the largest available block of memory to a requesting process, which can lead to inefficient memory utilization.

In order to reduce waste, the Best Fit memory allocation approach looks for the lowest available block of memory that suits the size of the process.