Write a C++ program that will implement first-fit, best-fit, next-fit and worst-fit memory management algorithms. Your program must do the following:

1. Input the memory size and the number and sizes of all the partitions (Limit the max number of the partitions to 5);

2. For each partition you may create a descriptor with at least the following information:

  • Partition size
  • Partition number
  • Partition status (Free/busy)
  • Size of unused space (Hole)
  • Job name (Three characters. E.g J01 or J15)

3. Input the job list that includes:

  • Jobs name
  • Jobs size

4. For each job you should create in your program a job descriptor that will include the job status (run/wait) and the partition number (If the job was allocated);

5. For each algorithm calculate initial memory allocation. Display the memory waste and the jobs that could not be allocated and have to wait.

Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.