• Courses
• Tutorials
• Interview Prep

X: m=malloc(5); m= NULL;        1: using dangling pointers
Y: free(n); n->value=5;         2: using uninitialized pointers
Z: char *p; *p = ’a’;           3. lost memory is:

• X—1 Y—3 Z-2
• (X—2 Y—1 Z-3
• X—3 Y—2 Z-1
• X—3 Y—1 Z-2

• Only P3
• Only P1 and P3
• Only P1 and P2
• P1, P2 and P3

• It always works and prints 6

• It always prints 0.

• It has undefined behaviour because p is not initialised to the allocated memory in fun()

• It gives a compile-time error because malloc cannot be used inside a function.

• calloc() allocates the memory and also initializes the allocates memory to zero, while memory allocated using malloc() has random data.

• calloc() takes two arguments, but malloc takes only 1 argument.

• Both malloc() and calloc() return \'void *\' pointer.

• All of the above

• void *
• Pointer of allocated memory type
• void **
• int *

• "ptr = calloc(m, n)" is equivalent to following
  ptr = malloc(m * n);
  

• "ptr = calloc(m, n)" is equivalent to following
  ptr = malloc(m * n); memset(ptr, 0, m * n);
  

• "ptr = calloc(m, n)" is equivalent to following
  ptr = malloc(m); memset(ptr, 0, m);
  

• "ptr = calloc(m, n)" is equivalent to following
  ptr = malloc(n); memset(ptr, 0, n);
  

• Compiler Error: free can\'t be applied on NULL pointer
• Memory Leak
• Dangling Pointer
• The program may crash as free() is called for NULL pointer.

• i, j and *k are stored in stack segment
• i and j are stored in stack segment. *k is stored on heap.
• i is stored in BSS part of data segment, j is stored in stack segment. *k is stored on heap.
• j is stored in BSS part of data segment, i is stored in stack segment. *k is stored on heap.

• Those that support recursion

• Those that use dynamic scoping

• Those that use global variables

• Those that allow dynamic data structures

• Dynamic memory allocation

• Static memory allocation

• Both dynamic and static memory allocation

• None of the above

There are 15 questions to complete.