_______ attacks the problem of fragmentation by moving all the allocated blocks to one end of memory, thus combining all the holes.

Related MCQs

• _______ attacks the problem of fragmentation by moving all the allocated blocks to one end of memory, thus combining all the holes.
• The function that allocates requested size of bytes and returns a pointer to the first byte of the allocated space is
• Records can be stored in an area of memory called _______ memory.
• A _______ list structure can be traversed in two directions-- in the forward direction from beginning of the list to end, or in the backward direction, from the end of the list to the beginning.
• Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the end node of the linked list
• _____is the problem of deciding whether or not a given string problem p appears in a text T.
• This data structure allows deletions at both ends of the list but insertion at only one end.
• A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?
• ________ is a linearly ordered sequence of memory cells.
• _______ is a structure used to represent the linear relationship between elements by means of sequential memory locations.