Accessing free list very frequently for wide range of addresses can lead to a) pagingb) segmentation faultc) memory errorsd) cache problems Answer: aExplanation: Paging in/out of disk will be caused.
How are free blocks linked together mostly and in what addressing order? a) circular linked list and increasing addressing orderb) linked list and decreasing addressing orderc) linked list and in no addressing orderd) none of the mentioned Answer: aExplanation: A common way is circular linked list and address are arranged in increasing order because merging …
What are the disadvantages of implementing a buddy system algorithm for free lists? a) internal fragmentationb) it takes so much spacec) we no more have the hole lists in order of memory address, so it is difficult to detect if 2 holes remain adjacent in memory and shall be merged into one holed) both a …
How does implicit free lists(garbage collection) works in adding memory to free list ? a) whichever comes last will be added to free listb) whichever comes first will be added to free listc) certain blocks cannot be used if there are no pointers to them and hence they can be freedd) makes a probabilistic guess …
What is buddy memory management of free lists? a) modified version of first fitb) buddy allocation keeps several free lists, each one holds blocks which are of one particular sizec) modified version of best fitd) a tree representation of free lists Answer: bExplanation: When an allocation request is received, the list that holds blocks that …
What are different ways of implementing free lists and which is simple among them? a) best fit, first fit, worst fit, simple-first fitb) best fit, first fit, worst fit, simple-best fitc) best fit, first fit, worst fit, simple-worst fitd) best fit simple-best fit Answer: aExplanation: The simplest form of memory management system can be called …
What data structures can be used in implementing a free list? a) only linked listb) linked list or sort treesc) arraysd) trees Answer: bExplanation: Sort trees can also be used in impelementing free lists which remaincomplex.
What are implicit and explicit implementations of freelists? a) garbage collection and new or malloc operators respectivelyb) new or malloc and garbage collection respectivelyc) implicit implementation is not favoredd) explicit implementation is not favored Answer: aExplanation: Gc and new most widely known.
Free lists are used in a) static memory allocationb) dynamic memory allocationc) contagious allocationsd) are used for speeding up linked list operations Answer: bExplanation: Their property is meant for dynamic allocations.
Which of the following is not the properties of XOR lists? a) X⊕X = 0b) X⊕0 = Xc) (X⊕Y)⊕Z = X⊕(Y⊕Z)d) X⊕0 = 1 Answer: dExplanation: The important properties of XOR lists are X⊕X=0, X⊕0=X and (X⊕Y)⊕Z = X⊕(Y⊕Z).