Dynamic Memory Management MCQ Quiz

int *p = malloc(50);

int *p = malloc(50 * sizeof(int));

int *p = calloc(sizeof(int), 50);

Both B and C

Aligns memory

Initializes memory to zero

Allocates on the stack

Guarantees contiguous physical pages

Both grow upwards

Both grow downwards

Stack grows downward, heap grows upward

Stack grows upward, heap grows downward

Stack is slower but dynamic; heap is faster and fixed

Stack is manual; heap is automatic

Stack is automatically managed; heap requires manual management

Heap variables are cleared on function exit

struct item *p = malloc(sizeof(struct item));

struct item p = malloc(sizeof(item));

item *p = new item;

struct item p; *p = malloc(sizeof(p));

free(&x); where int x;

free(p); where p points to malloced memory

free(p+1); where p points to malloced memory

free((void*)0x1234);

Always equivalent to free(p) and returns NULL

Keeps memory unchanged

Undefined behavior

Returns pointer to a zero-sized usable block

free(p); p = NULL; free(p);

free(p); free(p);

free(NULL);

p = realloc(p, 0); free(p);

Same address every call

Zero-initialized memory

Faster allocation

Thread safety

Stack

Heap

Static Memory

Code Segment