The function that allocates requested size of bytes and returns a pointer to the first byte of the allocated space is

Related MCQs

• 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
• In a linked list, the pointer of the last node contains a special value, called the ______ pointer.
• consider the function f defined here: struct item { int data; struct item * next; }; int f (struct item *p) { return((p==NULL) ||((p->next==NULL)||(p->data<=p->next->data) && (p->next))); } For a given linked list p, the function f returns 1 if and only if
• Which function returns a void pointers?
• _______ attacks the problem of fragmentation by moving all the allocated blocks to one end of memory, thus combining all the holes.
• _______ attacks the problem of fragmentation by moving all the allocated blocks to one end of memory, thus combining all the holes.
• A ________ linked list is a linked list structure in which each node has a pointer to both its successor and predecessor.
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head 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 last node of the linked lis
• A computer which can access an individual byte is called a ________ machine.
• A variable P is called pointer if__