A process requests more resources than its declared maximum in Banker’s Algorithm. What happens?

Assuming (FIFO) Page Replacement algorithm, A system has 3 page frames. Given the reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 How many page faults occur using FIFO?  

What is a race condition?

Which RAID level provides the best write performance but no fault tolerance?

A disk scheduler services requests in one direction until the end, then reverses direction. Which algorithm is this?

Why is DMA more efficient than programmed I/O for large transfers?

Why is the Optimal page replacement algorithm not implementable in practice?

Which memory allocation strategy chooses the first block large enough?

I understand and agree that the following are not allowed during this proctored test. No use of paper or electronic notes No books No electronic devices (e.g., second monitors, phones, ipads, or other devices that have access to the internet) (unless explicitly permitted) No electronic searches No AI tools (e.g., ChatGPT, etc.) No external help No other browsers or browser tabs open except for the tab used for completing the test. No other apps running that share my screen with others (except for shared screen with the proctor) No attempt to take screen shots of the questions I also understand that while taking this exam, I must Remain visible and within the camera frame. Maintain my eyes on the monitor which is used to take the exam. (unless a two screen setup is explicitly permitted) Make sure the room that I am in is free of background noise or other interruptions.

What is a symbolic (soft) link?