How does implicit free lists(garbage collection) works in adding memor – McqOptions

MCQOPTIONS

1.	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
Answer» D. makes a probabilistic guess

Discussion

No Comment Found

Related MCQs

Each data item in a record may be a group item composed of sub-items; those items which areindecomposable are called ________
The logical or mathematical model of a particular organization of data is called a _______________.
The time required in best case for search operation in binary tree is ____________.
Binary search algorithm cannot be applied to________ concept.
In a graph G if e=(u,v), then u and v are called ___________.
B-tree of order n is a order-n multiway tree in which each non-root node contains
Which of the following is true while inserting a new node in the list?
Linked lists are suitable for which of the following problems?
The concatenation of two list can performed in O(1) time. Which of the following variation oflinked list can be used?
The earliest use of__________ sorting was in conjunction with network analysis.