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.