Using the data that was supplied for the 25 jobs that are to

Using the data that was supplied for the 25 jobs that are to be processed in memory, develop a spreadsheet that has headers as follows:

Job #, Job Size, Time Needed, Arrives, Memory Block #, Block Size, Time Leaves Memory, TT, WTT

Show the results (one spreadsheet for each) for: First Fit, Best Fit, and Worst Fit Algorithms.

For this assignment, begin with Job 11 and go down through Job 25 (a total of 15 jobs). Have Job 11 arrive at time 0, and each job thereafter arrive 1 tick later (Job 12 arrives at time 1, Job 13 arrives at time 2, etc.). Follow the protocol that if a job arrives at the same time that a job is leaving, we allow the job leaving to proceed first, thus opening another free memory block for possible usage.

Job List

Memory List

Solution

------------------------------------------------------------------------------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------------------------