emory Management Programming Assignment Please if this can be coded in Java or C++ i would appreciate implement and test the GET-MEMORY algorithm This algorithm uses the Next-Fit(First-Fit-With-A-Roving-Pointer) technique. implement and test the FREE-MOMORY algorithm Implement the “GET_MEMORY” and “FREE_MEMORY” algorithms. Comprehensive testing must be done for each algorithm. Following are sample run results for each: GET_MEMORY IS RUNNING……… Initial FSB list
Memory Management Programming Assignment
Please if this can be coded in Java or C++ i would appreciate
implement and test the GET-MEMORY
This algorithm uses the Next-Fit(First-Fit-With-A-Roving-Pointer) technique.
implement and test the FREE-MOMORY algorithm
Implement the “GET_MEMORY” and “FREE_MEMORY” algorithms. Comprehensive testing must be done for each algorithm.
Following are sample run results for each:
GET_MEMORY IS RUNNING………
Initial FSB list
FSB# Location Size
1 7 4
2 14 10
3 30 20
. . .
. . .
Rover is 14
----------------------------------------------------------------------------
Allocation request for 5 words
Allocation was successful
Allocation was in location 14
FSB# Location Size
1 7 4
2 19 5
3 30 20
. . .
. . .
Rover is 30
----------------------------------------------------------------------------
Allocation request for 150 words
Allocation was not successful
.
.
.
__________________________________________________________
FREE_MEMORY IS RUNNING……..
Initial FSB list
FSB# Location Size
1 7 4
2 19 5
3 30 20
. . .
. . .
Rover is 30
----------------------------------------------------------------------------
De-allocation request of 4 words at location 3
FSB# Location Size
1 3 8
2 19 5
3 30 20
. . .
. . .
Rover is 30
----------------------------------------------------------------------------
Step by step
Solved in 2 steps with 1 images
