PROJECT

$1.$ User Interface: Implement a menu$-$based interface where users can input the list of block

sizes and process sizes, and choose which memory management algorithm to run.

$2.$ Memory Management Algorithms:

$$ Best Fit: Allocate the smallest free block that is large enough to hold the process.

$$ Worst Fit: Allocate the largest free block.

$$ First Fit: Allocate the first free block that is large enough to hold the process.

$3.$ Implementation:

$$ For each algorithm, you will need to write functions to allocate memory based on the

chosen algorithm.

$$ You will also need functions to deallocate memory when a process finishes.

$4.$ Menu Options:

$$ Input Lists: Allow users to input the list of block sizes and process sizes.

$$ Best Fit, Worst Fit, First Fit: Implement these options to execute the respective

memory management algorithms.

$$ Exit: Provide an option to exit the program.

$5.$ Example Output:

$$ Show the allocation and deallocation of memory blocks for each algorithm.

$$ Display any relevant information, such as fragmentation or remaining free space.

For the given input of block sizes and process sizes, let us go through the output based

on the First Fit algorithm:

Input:

Block Sizes: $\{100,500,200,300,600\}$

Process Sizes: $\{212,417,112,426\}$

Output:

Process No$.$ Process Size Block no$.$

$12122$

$24175$

$31122$

$4426$ Not Allocate