operating system

cont.#4.Given the following information;
Job list:
job number memory allocation
J1---740 k
J2---500k
J----700k
Memory List:
Memory Block Size
Block1------610k(low-order memory)
Block2------850k
Block3------700k(high-order memory)
Best-fit
In the Job List they have a Job1, Job2, Job3,..In memory list also have block1 to 3.The job1 has a memory requested is 740k so that the job 1 will go to block 2 while the size is 850k. In job 2 the memory requested is 500k and that's why they go to block 1 have a size of 610k. While the job3 has memory requested of 700k will go to block3 that have 700k.
First-fit
the job1 and the job2 they not allocate in block1 and 2.while the job3 is fit to the bock3
5.Given the following information:
Job List
job number memory requested
Job1---- 700k
job2----500k
Job3---740k
Memory List:
Memory Block Size
block1---610k (low-order memory)
block2---850k
block3---700k(high-order memory)
Best-fit:
job1 will go to block3. the job2 also go to block1. and the last job 3 goes to block2.
First-Fit:
6.
a.) Another variation of the free list algorithm is useful for very transient allocations of memory specially when all allocation are about the same size.
b.)It is compelled by there size and memory requested
7. Worst-fit the memory manager placed a process in the largest block of unallocated memory available. the placement will create the largest hold after the allocation, thus increasing the possibility that compare to best fit, another process can use the remaining space.
8. yes, the memory manager will know to adjust them by the value stored in relocation register all of the other values ( data values) one not marked and won't be changed after relocation other's numbers in the program, those indicating instruction, register, or constants use in the intruction, are also left alone