Which is not dynamic memory allocation function?

Related MCQs

• Records can be stored in an area of memory called _______ memory.
• If a function is declared as void fn(int *p), then which of the following statements is valid to call function fn?
• The keyword used to transfer control from a function back to the calling function is
• 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
• _______ list is a special list that is maintained, which consists of unused memory cells.
• ________ 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.
• Programming languages like FORTRAN and PASCAL allocate memory space for arrays ______.
• ________ method of collision resolution involves maintaining two tables in memory.
• _______ attacks the problem of fragmentation by moving all the allocated blocks to one end of memory, thus combining all the holes.