CONTINUOUS ALSO (All students perform with parameters a, b,c, d) 9.13 For six available memory partitions including (100 + ab) MB (F1), 170 MB, (40 + c) MB (F2), 205 MB (F3), 300 MB (F4) and 185 MB (F5 ) (in order), the optimal algorithm (best fit) will place processes of size 200 MB, 15 MB, 185 MB, 75 MB, 175 MB and 80 MB (in order)? Indicate which allocation requests cannot be met (if any). Draw diagrams showing the allocation sequence
Students can substitute the best-fit algorithm for first-fit or worst-fit. Specify in the presentation.
a=5 b=1 c=6 d=4