Part 1: Fixed Partitioning

1. Which partitioning setup could possibly reduce internal fragmentation and how?

• Because these partitions are generated dynamically, and each process is loaded into a
partition precisely the same size as the process, dynamic partitioning may be able to
eliminate internal fragmentation. There is no internal fragmentation in this approach. It
leads to a better utilization of the main memory. The operating system has exclusive use
of the first partition. The remaining area is broken up into sections. Each partition's size
will match the process's overall size. The best fit, first-fit, and next-fit methods are the
three techniques to achieve dynamic partitioning.
2. Based on the two partitioning setup above, would you recommend the implementation of
the fixed partitioning technique in developing automated machines? Why or why not?

• Yes, I can suggest the use of fixed partitioning in automated machines because the fault
can be easily detected in this partitioning, and it is very easy to implement. It can
prevent data loss during power outages or when software fails. Fixed partitions also
increase the chances of data recovery in critical situations.
3. In your perspective, what are the possible downside of utilizing an equally sized memory
partition? Rationalize your answer.

• A program may be too big to fit in a partition, it needs to be designed with the use of
overlays. Also, main memory utilization is inefficient. Any program, regardless of size
occupies an entire partition. Internal fragmentation wasted space due to the block
 of data loaded being smaller than the partition. Now, in every partition only one process
will be accommodated, therefore the degree of multiprogramming is restricted by a
number of partitions. The maximum size of the process is restricted by the size of the
partition therefore large size process cannot be accommodated.

Part 2: Dynamic Partitioning

4. What do you think is the possible reason why Process 2 was pulled/swapped out (e) of the
memory?
• Possible reasons can be.
a. As memory is full and some high priority tasks are needed the CPU, therefore, process 2 is
pulled out and replaced by process 4. That is why it is suspended.
b. Process 2 may have completed his entire execution and no longer needed the CPU time.
But in option (h) it again arrives therefore this option is not true.
c. Process 2 has been temporarily suspended because of the time-sharing mode of
execution CPU.

5. When Process 1 finishes the execution (g) and Process 2 is swapped back in the memory (h),
what possible condition or phenomenon can occur within the memory? Rationalize your
answer.
• All the updates for the memory block of process 1 have been saved on the hard disk, the
context of process 1 is then cleared and memory is marked free. Then the context of
process 2 is loaded and memory is allocated to Process 2. If the process finishes its burst
before the time quantum timer expires, then it is swapped out of the CPU just like the
normal FCFS algorithm. If the timer goes off first, then the process is swapped out of the
CPU and moved to the back end of the ready queue.
6. If you are to develop a file management system, would you suggest the implementation of
the dynamic partitioning technique in memory management? Why or why not?
• If we have only two options Fixed and Dynamic partitioning scheme, then I would
suggest implementing the dynamic partitioning scheme. But if we can implement the
more advanced technique of memory management then there is no need for dynamic
memory management as for files things require to be loaded from a hard disk.