1. Give at least three things a bankers algorithm needs to know to be able to process.
The three things for the bankers algorithm need to know are:
a. How much of each resource each process could possibly request (MAX).
b. How much of each resourc
QUESTIONS AND ANSWER
1. How does a first-come-first-served scheduling algorithm works?
Jobs are executed on first come, first serve basis. It is the simplest scheduling algorithm is the
simplest scheduling algorithm. Processes are dispatched accor
1. What is seek-time?
Seek-time is the time taken for a disk drive to locate the read/write head on the proper
track from the time it started requesting.
2. What are the disadvantages of using FCFS and SSTF?
The disadvantage of using FCFS is that