This project is a simulation of how an operating system performs memory management using the first-fit algorithm. It allocates memory dynamically and uses dynamic data structures within the allocated memory.
The purpose of this project is primarily for learning. It provides a visualization or simulation of memory management techniques used by operating systems. It demonstrates how memory is allocated, deallocated, and managed using OS algorithms.
The data structures are coded to only use the memory that has been allocated by the OS algorithm, this is to make use of the allocated memory.
To run the project, follow these steps:
-
Clone the repository to your local machine:
-
Navigate to the project directory:
-
Compile the source files using
make: -
Run the executable:
-
Follow the on-screen instructions to choose a data structure to visualize.
- Linked List
- Hash Map (Not implemented yet)
- Binary Tree (Not implemented yet)
Contributions are welcome! Feel free to fork the repository, make changes, and submit a pull request.
This project is licensed under the MIT License - see the LICENSE file for details.