Explain approaches to reuse free memory area in a heap, Computer Engineering

Discuss two main approaches to reuse free memory area in a heap.

Two major approaches to reuse free memory area in a heap are:

First-fit: Allocate the first hole which is big sufficient. Searching can begin either at the starting of the set of holes or where the previous first-fit search ended. Searching is stopped immediately when a free hole is found which is large enough

Best-fit: Assign the smallest hole which is big enough; whole list is searched, unless ordered through size. This strategy generates the smallest leftover hole.

Posted Date: 5/7/2013 8:06:55 AM | Location : United States







Related Discussions:- Explain approaches to reuse free memory area in a heap, Assignment Help, Ask Question on Explain approaches to reuse free memory area in a heap, Get Answer, Expert's Help, Explain approaches to reuse free memory area in a heap Discussions

Write discussion on Explain approaches to reuse free memory area in a heap
Your posts are moderated
Related Questions
Uninformed Search Strategies: To be able to undertake an unaware search, there is really important that the entire agent needs to know is the primary state, then the possible

Q. Describe Ergonomic Keyboards? Ergonomics is the study of environment, conditions as well as efficiency of workers. Ergonomics proposes that keyboard wasn't designed with hum

Explain FIFO Page replacement algorithm. FIFO policy: This policy only removes pages in the order they entered in the main memory. By using this policy we simply eliminate a

How sensors uses in real time process control Sensors send data (through an analogue to digital converter - ADC) to a microprocessor or computer that decides whether or not to

Explain the term Internet. Internet: The Internet, an umbrella term covering countless network and services that comprise a super-network, is a global network of compute

Find the Boolean expression for logic circuit shown in Figure below and reduce it using Boolean algebra. Ans. Y = (AB)' + (A' + B)' = A' + B' + AB' by using Demorgan's Theorem. =

How to get an output: Please enter a number between 0 and 6 (Enter to stop): 2 The Day of Week is Tuesday Please enter a number between 0 and 6 (Enter to stop): 9 Input Invalid Ple

In the organisation of an associative memory, many registers are used: Comparand Register (C): This register is used to grasp the operands, which are being searched for, or

How can you pass a struct by reference in e?   The question is phrased in a tricky way because passing by reference is the default and only possible way to pass structs in e. I

Q. Describe Independent Loops in fortran? HPF offers extra opportunities for parallel execution by employing the INDEPENDENT directive to declare the iterations of a do-loop is