1. Objectives

• To simulate First Fit and Best Fit memory allocation algorithms using C/C++

2. Procedures

1) Simulate First Fit Memory Allocation Algorithm

We keep it simple. The number of memory partition (blocks) and size of processes are in units. The unit can be any size, say, 16 Kbytes or 64 Kbytes.

In this program, you will:

• Implement the First Fit algorithm. Note that each process is checked against starting from the first block and gets allocated to the first block that fits it.
• When the process gets allocated, output the information on where it is placed and the remaining block size.
• You will need to define MEMORY byte Size (256KB)
• UNIT in bytes Size (2KB)
• Process id that is used to mark fragmentation
• Maximum number of units for a hole to be considered a fragment.
• Display Main Memory Allocation
• Display average number of external fragments
• Display average allocation time
• Display percentage of allocation denials
• See a sample output on next page.

b. Built and debug the program. Copy and paste the code below.

c. Run the program Crop the output windows (Snipping Tool is good to use) and paste them below.