_____ is the dynamic storage-allocation algorithm which results in the smallest leftover hole in memory.

Question

asked Dec 4, 2018 151k views

1 Answer

Elliott De Launay · Answer 1 · 2018-12-09T06:43:56+0000

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.

_____ is the dynamic storage-allocation algorithm which results in the smallest leftover hole in memory.

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Related questions

Categories

Other Questions