Complete the code to identify the main purpose of buffering in I/O operations.
Buffering helps to [1] data between the device and the process.
Buffering temporarily holds data to transfer it smoothly between the device and the process, preventing speed mismatches.
Complete the code to name a common I/O scheduling algorithm that reduces seek time.
The [1] algorithm schedules disk I/O requests by moving the head in one direction.
The SCAN algorithm moves the disk arm in one direction servicing requests, reducing seek time compared to FIFO.
Fix the error in the statement about double buffering.
Double buffering uses two buffers to [1] data transfer and processing.
Double buffering allows overlapping data transfer and processing to improve efficiency.
Fill both blanks to complete the dictionary comprehension that maps I/O scheduling algorithms to their key feature.
{alg: alg[1] for alg in ['FIFO', 'SSTF', 'SCAN'] if alg [2] 'SSTF'}The code converts algorithm names to lowercase and filters out 'SSTF' using '!='.
Fill all three blanks to create a dictionary comprehension that maps buffer names to their sizes if size is greater than 1024.
{ [1]: [2] for [3] in buffers if buffers[[3]] > 1024 }The comprehension uses 'name' as key, 'size' as value, and iterates over 'name' in buffers.