hello all

i am a newbie as u can see i was searching for a good forum to post my question and i found this , i hope i can find the ANSWER here.

well, i am taking an Operating system class at the university, and we have a task about the Memory placement!

what is required that we should make Four DIFFERENT Scenarios for the memory placement strategies! :

" first fit "
" next fit "
" best fit"
" worst fit"

each scenario contain of four different Requests, and four Holes to place that requests.

BUT , each scenario must only WORK for that method!

ex) first fit scenario will work only on first fit and any other strategy will fail to place the requests on it!

i hope i explained about what i am straggling around here been trying so long and its just not working with me
MOSS t of us do not do memory management, it is don by the operating system. Some types of operations work best when the memory is contiguous.  That is, all the memory needed by a task is all in one area with no 'holes'.

For help with the problems given, you need to consult you text box to understand what the issues are.

" first fit "
" next fit "
" best fit"
" worst fit"

Have to be understood in the context of the book  you are working with.

Some technology in use today resolves the issue at the hardware LEVEL, so it becomes a pointless exercise to study this, expect it helps you learn how to study. Which may be the real objective of the course.Actually this sounds more like a logic puzzle than a hardware question...

You have 2    5 gallon containers.
You need to measure out 3 Gallons of water.

How do you do it ? ?Lol patio