Exercise:Assume memory blocks of sizes: 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB.Process sizes: 212 KB, 417 KB, 112 KB, 426 KB Apply the First Fit, Best Fit, and Worst Fit allocation strategies and show the allocation result for each process. Indicate which block each process is assigned to, or if it cannot be allocated. Discuss which strategy results in the least amount of wasted space.

Describe the file system hierarchy and how the OS resolves file pathnames during file access.

Exercise:Given the following page reference string and a memory with 3 page frames, compute the number of page faults using: FIFO (First-In, First-Out) LRU (Least Recently Used) Optimal Page Replacement Reference String:7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3 Instructions:Draw a table with 3 rows for the page frames and go step by step through the reference string for each algorithm, counting page faults.

The __________ of a file system tracks which disk blocks are free for use.

What is the main advantage of using virtual memory?

In the Banker’s Algorithm, a system is in a safe state if:

Which mechanism allows the OS to handle multiple I/O requests efficiently?

A __________ occurs when a program accesses a page not currently in physical memory.

The operating system uses ________ to communicate with hardware devices, triggered by events.

The __________ scheduler selects from among the processes in memory that are ready to execute and allocates the CPU to one of them.