Question

Write a C++ Program that will implement 4 Memory Management algorithms:

A) Best-Fit (Fixed partition)
B) First-Fit
C) Next-Fit
D) Worst-Fit (Dynamic partitions)
Your program must do the following:
1. Program Input:
User will input to the program:
a) Main Memory information, including:
i. The Number of Memory partitions.
ii.The Size of each memory partition.
b) Process information (assign a unique identifier to each job):
iii. Number of processes
iv. Memory requirements for each process/job
2. For each algorithm, your program should have a common data structure (class or struct) that will represent the process/job, and should contain the following variables.
i. Name of the process/ Process id (number or word)
ii. Process/job status (Run/Wait),
iii. Partition Name/ID the process/job was assigned to
You can create an array or list of the object to represent the job queue.
3. For each algorithm, your program should have a common data structure (class or struct) that will represent a memory partition and should have the following variables:
i. Partition Name/ID
ii. A Bool, to represent if the partition being used, (is there a process already assigned to it
iii. Process Name/Id that is assigned to it.
You can create an array or list of the object to represent the Main Memory.
4. Program output:
a) Initial memory allocation: Calculate and display a list of initial memory allocation, i.e which process was assigned to which partition, after the first round of allocation
b) Memory waste: Program will calculate and display the memory waste for each partition,
c) Total waste for each algorithm.
d) A list of Processes in the waiting State(was not assigned to a partition).
Please ensure to include the total waste for each algorithm & use one .cpp file. If possible, please code the memory management algorithms as functions, so all of the functions may be called in main().

Answer 1

A C++ program is required to implement and compare four memory management algorithms, using classes or structs to represent processes and memory partitions, handling user inputs, and providing detailed outputs about memory allocation and waste.

Step-by-step explanation:

The student has asked for a C++ program that implements four memory management algorithms: Best-Fit (Fixed partition), First-Fit, Next-Fit, and Worst-Fit (Dynamic partitions). The program needs to handle user input for main memory information and process information, work with a data structure representing both processes/jobs and memory partitions, and provide outputs such as initial memory allocation, memory waste per partition, and total waste for each algorithm.

The solution should be designed with at least two classes or structs, one representing a Process with attributes like Process id, Status (Run/Wait), and Partition ID it was assigned to, and another representing a Memory Partition, with attributes including Partition Name/ID, a bool indicating if it's in use, and the Process ID assigned to it. The functionality for each memory management algorithm is ideally encapsulated in separate functions.

Overall, the program will also calculate and display the initial memory allocation, memory waste for each partition, total waste for each algorithm, and a list of processes that are in the waiting state, providing a comprehensive overview of how each algorithm manages memory.