menu
Askians
Login
Register
My account
Edit my Profile
Private messages
My favorites
Ask a Question
Questions
Unanswered
Tags
Categories
Ask a Question
_____ is the dynamic storage-allocation algorithm which results in the smallest leftover hole in memory.
asked
Dec 4, 2018
151k
views
0
votes
_____ is the dynamic storage-allocation algorithm which results in the smallest leftover hole in memory.
Computers and Technology
high-school
Gabe Johnson
asked
by
Gabe Johnson
8.2k
points
answer
comment
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
4
votes
Dynamic memory allocation algorithms (like the heap in a C program) suffer from fragmentation if some of the memory is released. The "best-fit" algorithm finds the smallest hole in memory big enough to fit the request amount.
Elliott De Launay
answered
Dec 9, 2018
by
Elliott De Launay
8.4k
points
ask related question
comment
share this
0 Comments
Please
log in
or
register
to add a comment.
← Prev Question
Next Question →
No related questions found
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.
9.4m
questions
12.2m
answers
Other Questions
“What does it mean when we “rework” copyrighted material?”
The book shows how to add and subtract binary and decimal numbers. However, other numbering systems are also very popular when dealing with computers. The octal (base 8) numbering system is one of these.
Seven basic internal components found in a computer tower
Please help me ! All you do is just put it it all in your own words ! Please this is for my reported card!i don't know how to put it in my own words because my English is not that good!
describe an advance in technology that makes life more enjoyable. what discoveries contribute to this technology?
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
Search Askians