Which scheduling algorithm allocates CPU time to processes based on their priority and may lead to starvation of lower-priority processes?

In which scheduling algorithm does each process get executed for a fixed time slice before moving on to the next process?

Which scheduling method is characterized by the fact that the process that arrives first gets executed first?

Which scheduling algorithm is designed to minimize the average waiting time and executes the shortest tasks first?

In a multi-level scheduling system, which characteristic is typically used to categorize processes into different queues?

What is a potential disadvantage of using non-preemptive scheduling in an operating system?

Which scheduling algorithm maintains a fixed time quantum for each process, allowing them to share CPU time fairly?

Which scheduling algorithm is most likely to result in starvation if a high-priority task continually arrives?

In which scheduling approach does the operating system use multiple queues with different priority levels for processes, allowing processes in higher-priority queues to be scheduled before those in lower-priority queues?

Which scheduling algorithm is primarily designed to minimize wait time for all processes by always executing the process with the smallest burst time next?

What memory allocation strategy is characterized by placing a process in the first available memory block that is large enough?

Which memory management technique divides the process's memory into fixed-size blocks and is commonly used in modern operating systems?

In memory management, what technique involves temporarily transferring data from RAM to disk to free up memory space?

Which memory allocation strategy attempts to find the largest available memory block for process allocation?

What is the main disadvantage of contiguous memory allocation?

Which memory management technique allows processes to be split into fixed-size units that can be stored in non-contiguous locations in memory?

What is the primary goal of memory management techniques such as paging and swapping?

In which memory allocation strategy does the system always select the smallest available block that meets the need of the process?

What is a key advantage of using paging in memory management?

Which memory allocation method requires that all processes be loaded into a contiguous block of memory?

What type of fragmentation occurs when there is unused space within allocated memory blocks?

Which file management technique divides files into variable-sized segments, allowing for more efficient use of memory?

Which type of fragmentation occurs when there is enough total free memory space, but it is not contiguous?

In a file system, what is the primary purpose of a file allocation table (FAT)?

What is the main disadvantage of internal fragmentation in memory management?

Which of the following best describes a file system?

Which memory management technique splits memory into fixed-sized blocks to minimize fragmentation?

In a fragmented file system, what is the primary disadvantage of using contiguous allocation for files?

What is the key benefit of using dynamic file allocation in a file system?

What does external fragmentation specifically refer to in memory management?