OS: Memory and Concurrency Control

Explain virtual memory and its benefits, such as process isolation and larger address space.

Describe how paging and page tables translate virtual addresses to physical addresses.

Compare page replacement algorithms (e.g., LRU, FIFO) by calculating page faults for a given reference string.

Identify a race condition in a code snippet and use a mutex to protect the critical section.

Solve a producer-consumer problem using semaphores.

Compare binary and counting semaphores and apply them to a resource allocation problem.

Identify the four Coffman conditions for deadlock in a given system.

Apply a deadlock prevention strategy (e.g., resource ordering) to resolve a potential deadlock.