Explain about dynamic memory allocation algorithm?
- 1 Answers
- 982 Views
- I also Faced
- E-Mail Answers
Answer / 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 |
if You do not cd drive then how will u format c drive ?
what basically a system call is?
in a time-sharing operating system, when the time slot given to a process is completed,the process goes from the Running state to the: a) BLOCKED state b) Ready state c) SUSPENDED state d) Terminated state
3 Answers Public Service Commission,
if you are using external package for configuring send mail what is the name of the package?
What is LOM and how do you access it?
Tell me what are the hardware problem you face regularly in your organization?
what is the ways to infect the system by virus?
If you do not have cd drive then how will you format c drive?
If system does not boot What are the files missing ? And how to troubleshoot the problem without reinstalling OS ?
What is Awk and Sed?
What items of information about a task might be useful in real time scheduling?
Explain the process control block of UNIX ?
SDK 
