Which of the following is correct for dynamic array allocation?

The correct answer is B: int *arr = malloc(n * sizeof(int));. Dynamic array allocation requires pointer and malloc() with proper size calculation. VLAs are not standard C.

What will this code do? int i = 0; while(i < 5) { printf("%d ", i++); if(i == 3) break; }

The correct answer is A: Prints: 0 1 2. Post-increment: prints 0 (i becomes 1), prints 1 (i becomes 2), prints 2 (i becomes 3). When i==3, break executes. Output: 0 1 2

In the declaration 'int *p, q;', what are the data types?

The correct answer is B: p is pointer to int, q is int. The '*' applies only to the immediately following variable. So 'int *p' declares p as pointer to int, and 'q' is just an int.

Analyze this code: for(int i = 0; i < 5; i++) { if(i == 2) continue; if(i == 3) break; printf("%d ", i); } What is the output?

The correct answer is A: 0 1. When i=0: prints 0. When i=1: prints 1. When i=2: continue skips printf. When i=3: break terminates the loop. Output is '0 1'.

What is the output of: #define MIN(a,b) ((a)

The correct answer is B: 10. MIN(10, 5*2) expands to ((10)

Home

Home › Subjects › C Programming › Dynamic Memory

C Programming
Dynamic Memory

C language from basics to advanced placement prep

20 Q 10 Topics Take Mock Test

Difficulty: All Easy Medium Hard 1–10 of 20

Topics in C Programming

All Basics & Syntax 86 Data Types & Variables 97 Control Flow 100 Functions 99 Arrays & Strings 100 Pointers 99 Structures & Unions 100 File Handling 100 Dynamic Memory 98 Preprocessor 99

Q.1 Hard Dynamic Memory

Which memory allocation technique provides better locality of reference for accessing array elements?

A Allocating each element separately with malloc

B Single malloc for contiguous array

C Using static arrays

D Allocating with calloc for zeroed memory

Correct Answer: B. Single malloc for contiguous array

EXPLANATION

Contiguous allocation places array elements next to each other in memory, improving cache hits and CPU performance through spatial locality.

Test

Q.2 Hard Dynamic Memory

In competitive coding, when implementing dynamic trees, which traversal is most suitable for level-order?

A Recursion with DFS

B Stack-based iteration

C Queue-based BFS using dynamic allocation

D In-order traversal

Correct Answer: C. Queue-based BFS using dynamic allocation

EXPLANATION

Level-order traversal requires BFS which uses a queue. Dynamic queue allocation handles arbitrary tree sizes efficiently.

Test

Q.3 Hard Dynamic Memory

What is the memory overhead when allocating 1000 integers vs 1 integer in a system with malloc metadata?

A Negligible difference

B Proportional to number of allocations

C Fixed overhead per allocation regardless of size

D Exponential with allocation count

Correct Answer: C. Fixed overhead per allocation regardless of size

EXPLANATION

Each malloc() call has fixed metadata overhead (typically 8-16 bytes). Single allocation of 1000 ints has less overhead than 1000 separate allocations.

Test

Q.4 Hard Dynamic Memory

For a dynamic hash table with chaining, if collision occurs, the new element should be inserted where?

A Always at the beginning of the chain

B Always at the end of the chain

C In sorted position

D Depends on implementation, typically at beginning for O(1)

Correct Answer: D. Depends on implementation, typically at beginning for O(1)

EXPLANATION

While both work, inserting at beginning provides O(1) insertion; end requires traversal. Choice depends on use case.

Test

Q.5 Hard Dynamic Memory

Which of these represents proper error handling for malloc in competitive programming?

A int *arr = (int*)malloc(n * sizeof(int)); if(!arr) return -1;

B int *arr = (int*)malloc(n * sizeof(int));

C int *arr = malloc(-1);

D int *arr = (int*)malloc(0);

Correct Answer: A. int *arr = (int*)malloc(n * sizeof(int)); if(!arr) return -1;

EXPLANATION

Checking if malloc returns NULL before using the pointer is essential error handling. If allocation fails, the program should handle it gracefully rather than proceeding with NULL.

Test

Q.6 Hard Dynamic Memory

In a dynamic stack implementation for competitive programming, how should you handle reallocation when the stack becomes full?

A Use realloc() to double the capacity and copy old data

B Return an error and stop accepting elements

C Allocate a new stack dynamically

D Use a fixed-size array instead

Correct Answer: A. Use realloc() to double the capacity and copy old data

EXPLANATION

Doubling capacity and using realloc() provides amortized O(1) insertion with manageable memory overhead, which is the standard approach for dynamic data structures.

Test

Q.7 Hard Dynamic Memory

For implementing a dynamic stack in competitive programming, which memory management approach is best?

A Pre-allocate fixed size array on stack

B Single malloc for max capacity, track top with index

C malloc/free for each push/pop operation

D Use global static array

Correct Answer: B. Single malloc for max capacity, track top with index

EXPLANATION

Single allocation with index tracking minimizes malloc/free overhead, suitable for competitive programming time constraints.

Test

Q.8 Hard Dynamic Memory

Consider this: char *p = malloc(10); strcpy(p, "Hello World"); What occurs?

A String is copied successfully

B Buffer overflow - writes beyond allocated 10 bytes

C Null terminator is lost

D Compilation error

Correct Answer: B. Buffer overflow - writes beyond allocated 10 bytes

EXPLANATION

"Hello World" is 11 bytes (including null terminator). Writing to 10-byte buffer causes buffer overflow, corrupting adjacent memory.

Test

Q.9 Hard Dynamic Memory

What is a potential issue when allocating very large contiguous blocks (>10^8 bytes) dynamically?

A malloc() always succeeds for any size

B Fragmentation and allocation failure, should check return value

C Integer overflow in size calculation

D Free space is automatically allocated

Correct Answer: B. Fragmentation and allocation failure, should check return value

EXPLANATION

Large allocations may fail due to heap fragmentation or insufficient contiguous memory. Always check malloc() return for NULL.

Test

Q.10 Hard Dynamic Memory

What is the typical behavior if malloc() is called in a loop without corresponding free() calls?

A Program automatically clears memory

B Memory leaks accumulate, eventually causing program crash

C Compiler optimizes and prevents leaks

D Memory is recycled automatically

Correct Answer: B. Memory leaks accumulate, eventually causing program crash

EXPLANATION

Without freeing, allocated memory accumulates until system runs out of heap space, causing allocation failure or crash.

Test

1 2

All Subjects & Topics

Govt. Exams

Entrance Exams

Teacher Exams

Subjects

Quick Links

C Programming Dynamic Memory

C Programming
Dynamic Memory