05 Act

You might also like

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

RAHIM, HAGUIAR S.

BE301P

Instructions: Analyze the illustrations and answer the corresponding questions for
each. Use 3-5 sentences in answering.

Part I: Fixed Partitioning

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

The utilization of dynamic partitioning may potentially reduce internal


fragmentation as a result of the partitions' dynamic creation, whereby each process is
loaded into a partition precisely equal in size to itself. There is no internal
fragmentation with this approach. It makes the main memory work more effectively.
The operating system is assigned the first partition. Parts of the remaining space are
separated. Each partition's size will match the process's dimensions. Dynamic
partitioning may be implemented in three different ways: best-fit, first-fit, and next-
fit.

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 recommend fixed partitioning for automated machines as it is quite


simple to install and faults may be readily identified in it. When software
malfunctions or there is a power outage, it can stop data loss. In dire circumstances,
fixed partitions can improve the likelihood of data recovery.

3. In your perspective, what are the possible downside of utilizing an equally sized
memory partitions? Rationalize your answer.
Overlays must be used in the design of a program if it is too large to fit inside a
partition. Additionally, there is wasteful use of the main memory. Every program, no
matter how big, takes up a whole partition. Since the loaded data block was less than
the partition, internal fragmentation resulted in space being wasted. The degree of
multi programming is now limited by the number of partitions because each partition
can only hold one process at a time. Additionally, because each partition has a
maximum size, big processes cannot be handled.

Part II: 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

 Because memory is full and the CPU is required for certain high-priority
activities, process 2 is removed and replaced by process 4. It is halted as a result.

 It's possible that Process 2 finished running and didn't require the CPU time
anymore. However, option (h) has it again, hence this option cannot be true.

 Process 2 has been placed on temporary hold due to the CPU's time-sharing
method of execution.

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.

During the clearing of Process a 1 context and the marking of memory as free, all
changes for the memory block of Process 1 have been stored to the hard drive.
Process 2 then loads its context and receives memory allocation. Similar to how the
standard FCFS method works, the process is switched out of the CPU if its burst is
completed before the time quantum timer expires. The process is switched out of the
CPU and placed at the back of the ready queue if the timer expires before it does.

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?

Implementing the dynamic partitioning scheme is what I would advise doing if


there are only two alternatives accessible fixed and dynamic. However, as data must
be loaded from a hard disk, dynamic memory management will not be necessary if the
more sophisticated memory management approach is put into practice.

You might also like