I'm asking this on the C++ board because I really think it's the best place, although it isn't coding.
I am studying for a test, but one concept eludes me.
If I have a real memory unit of 1024 locations
Then requests come in of process of these sizes
90, 120, 80, 130, 70
Then the 2nd and 5th process finishes
I then have this table of additional requests for memory. Each answer is suppose to depend on the other answers
Request Best Fit Worst Fit First Fit
a 65 420 490 90
b 45 90 555 155
c 70 135 600 420
d 15 490 670 490
e 25 505 685 505
I am supposed to know how to give the starting location or the memory allocated to each process. Each answer depends of the previous answers. Can anyone jst help me get started understanding this?