+1 vote
in Data Structures & Algorithms I by (110k points)
What are different ways of implementing free lists and which is simple among them?

(a) best fit, first fit, worst fit, simple-first fit

(b) best fit, first fit, worst fit, simple-best fit

(c) best fit, first fit, worst fit, simple-worst fit

(d) best fit  simple-best fit

This interesting question is from Free List topic in division Types of Lists of Data Structures & Algorithms I

I had been asked this question by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct option is (a) best fit, first fit, worst fit, simple-first fit

For explanation: The‭ ‬simplest form of memory management system can be called as first-fit.‭ ‬a device or system maintains a single‭ ‬list of free memory locations.‭ ‬When request to memory is sent,‭ ‬the list is searched and the first block that is large enough is returned.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...