PROBLEM SOLVING FORMAT

Name: RODJEAN A. SIMBALLA Date: Grade:

Course & Section: BSIT 3D Topic: Lesson 2: Memory Management

Question and Answer:

1. What requirements is memory management intended to satisfy?

Answer:
 RELOCATION
 PROTECTION
 SHARING
 LOGICAL ORGANIZATION
 PHYSICAL ORGANIZATION

2. Why is the capability to relocate processes desirable?

Answer:
Typically, it is not possible for the programmer to know in advance which other programs will be resident
in main memory at the time of execution of his or her program. In addition, we would like to be able to
swap active processes in and out of main memory to maximize processor utilization by providing a
large pool of ready processes to execute. In both these cases, the specific location of the process in
main memory is unpredictable.

3. What are some reasons to allow two or more processes to all have access to a particular region of
memory?
Answer:
If a number of processes are executing the same program, it is advantageous to allow each process to access
the same copy of the program rather than have its own separate copy. Processes that are cooperating on some
task may need to share access to the same data structure.

4. What is the difference between internal and external fragmentation?

Answer:
Phenomenon, in which there is wasted space internal to a partition due to the fact that the block of
data loaded is smaller than the partition, is referred to as internal fragmentation.

5. What is the difference between a page and a frame?

Answer:

PAGE FRAME

Chunk of a process Chunk of memory

 6. What is the difference between a page and a segment?
Answer:
The difference, compared to dynamic partitioning, is that with segmentation a program may occupy
more than one partition, and these partitions need not be contiguous. Whereas paging is invisible to
the programmer, segmentation is usually visible and is provided as a convenience for organizing
programs and data.

7. What is the difference between simple paging and virtual memory paging?
Answer:
SIMPLE PAGING VIRTUAL MEMORY PAGING
In simple paging, all the pages of a process But in virtual memory, not all pages of a
must be in main memory for process to run, process need be in main memory frames for
unless overlays are used the process to run. Pages may be read in as
needed.

8. Explain thrashing.
Answer:
Thrashing happens when too many computer processes compete for inadequate memory resources.
Thrashing can occur due to several factors, with the most prominent reason being insufficient RAM or
memory leakage. In a computer, some applications have higher priorities than others and this can also
attribute to thrashing when there is a lack of memory resources. Thrashing can cause slowdown of the
system performance since data transfer has to be between the hard drive and physical memory. One
of the early signs of thrashing is when an application stops responding while the disk drive light blinks
on and off. The operating system often warns users of low virtual memory when thrashing is occurring.

9. Briefly define the alternative page fetch policies.

Answer:

Demand Paging - a page is brought to main memory Pre-Paging - pages other than the one demanded by
only when a reference is made to a location on that a page fault are brought in.
page.

10. What is the difference between resident set management and page replacement policy?
Answer:
RESIDENT SET MANAGEMENT
In resident set management the operating
system must decide how much main memory to
allocate to a particular process when that
process is swapped in. This can be a static
allocation made at process creation time, or it
can change dynamically.
PAGE REPLACEMENT POLICY
In page replacement policy when the memory is
full, a decision must be made as to which page
or pages are to be replaced. The page
replacement policy determining where the page
should be load, and how the page load, and
what type of algorithm should be used to load a
page.
11. What is the relationship between FIFO and clock page replacement algorithms?
Answer:
The clock policy is similar to FIFO, except that in the clock policy, any frame with a use bit of 1 is passed
over by the algorithm.

12. What is the difference between are resident set and a working set?
Answer:
Resident set is that portion of the process image that is actually in real-memory at a particular
instant. Working set is that subset of resident set that is actually needed for execution.

13. What is the difference between demand cleaning and precleaning?

Answer:
The difference between demand cleaning and pre-cleaning is that a cleaning policy is the opposite of a
fetch policy: it is concerned with determining when a modified page should be written out to
secondary memory. With demand cleaning, a page is written out to secondary memory only when it
has been selected for replacement. A pre-cleaning policy writes modified pages before their page
frames are needed so that pages can be written out in batches.