+1 vote
in Data Structures & Algorithms I by (110k points)
How does implicit free lists(garbage collection) works in adding memory to free list ?

(a) whichever comes last will be added to free list

(b) whichever comes first will be added to free list

(c) certain blocks cannot be used if there are no pointers to them and hence they can be freed

(d) makes a probabilistic guess

I want to ask this question from Free List in division Types of Lists of Data Structures & Algorithms I

The question was posed to me in final exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right answer is (c) certain blocks cannot be used if there are no pointers to them and hence they can be freed

The explanation is: When no pointers pointing a block that means it is useless to be in memory.

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

...