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

Assignment Help:

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.


Related Discussions:- Explain approaches to reuse free memory area in a heap

DBMS, what is dbms goal?

what is dbms goal?

Explain the application of e-commerce in home banking, Explain the applicat...

Explain the application of E-Commerce in Home Banking. Home Banking: E-commerce is employed in Home Banking like one call or one click. Internet banking or online bank

Types of messages, Q. Types of messages? The messages can be of many ty...

Q. Types of messages? The messages can be of many types.  A specific field of all messages may be reserved to signify message type.  The message passing primitives are like thi

Explain the characteristics of program interpretation model, Explain the ch...

Explain the characteristics of program interpretation model. The program interpretation model characteristics are: The source program is retained into the source form it

Software architecture of microprocessor, The 68HC11 series is based on the ...

The 68HC11 series is based on the Motorola 6800/1 programming instruction set and hence is a fairly simple 8 bit microprocessor. The internal structure of the 6800/1 is shown below

DBMS, Difference between Paperbase and computer base system?

Difference between Paperbase and computer base system?

Define the do while loop, The do while Loop This is very similar to the...

The do while Loop This is very similar to the while loop except that the test occurs at the end of the loop body. This guarantees that the loop is executed at least once before

Declarative programming languages, Declarative programming languages: ...

Declarative programming languages: We notice that declarative programming languages can have some better compensation over procedural ones. Actually, it is often said that a J

Combinatorial and scheduling problems, Combinatorial and Scheduling Proble...

Combinatorial and Scheduling Problems: One class of problems is concerned with specifying optimal scheduled. A classical example is the Travelling Salesperson Problem where

What is ai, Artificial intelligence ("AI") can mean a lot of things too man...

Artificial intelligence ("AI") can mean a lot of things too many people. Much confusion arises that the word 'intelligence' is ill-defined. The phrase is so broad that people have

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd