Answer Posted / Madhvi Sharma
Dynamic memory allocation is a method of requesting and releasing computer storage during program execution. There are several algorithms used for this purpose:
1. First-fit: The first suitable block of free memory found is allocated.
2. Best-fit: The smallest suitable block of free memory is allocated.
3. Worst-fit: The largest suitable block of free memory is allocated.
4. Next-fit: The next available memory block that is larger than the requested size is allocated.
5. Buddy system: Large blocks are divided into smaller blocks, and each block has a buddy (half its size). When a block is freed, it is merged with its buddy if possible.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
