Memory Allocation MCQ

Test your knowledge with important Memory Allocation MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Memory Allocation MCQs on Bissoy. Bissoy App

• The incorrect statement with respect to dangling pointers is . . . . . . . .
  ক

  Pointer pointing to non-existent memory location is called dangling pointer

  খ

  When a dynamically allocated pointer references the original memory after it has been freed, a dangling pointer arises

  গ

  If memory leak occurs, it is mandatory that a dangling pointer arises

  ঘ

  Dangling pointer may result in segmentation faults and potential security risks
• The advantage of using linked lists over arrays is that . . . . . . . .
  ক

  Linked list is an example of linear data structure

  খ

  Insertion and deletion of an element can be done at any position in a linked list

  গ

  Linked list can be used to store a collection of homogenous and heterogeneous data types

  ঘ

  The size of a linked list is fixed
• The number of arguments taken as input which allocating memory dynamically using malloc() is . . . . . . . .
  ক

  0

  খ

  1

  গ

  2

  ঘ

  3
• The type of linked list in which the node does not contain any pointer or reference to the previous node is . . . . . . . .
  ক

  Circularly singly linked list

  খ

  Singly linked list

  গ

  Circular doubly linked list

  ঘ

  Doubly linked list
• Queue data structure works on the principle of . . . . . . . .
  ক

  Last In First Out (LIF0)

  খ

  First In Last Out (FILO)

  গ

  First In First Out (FIFO)

  ঘ

  Last In Last Out (LILO)
• Suppose we have a one dimensional array, named 'x', which contains 10 integers. Which of the following is the correct way to allocate memory dynamically to the array 'x' using malloc()?
  ক

  x=(int*)malloc(10);

  খ

  x=(int*)malloc(10,sizeof(int));

  গ

  x=malloc(int 10,sizeof(int));

  ঘ

  x=(int*)malloc(10*sizeof(int));
• Garbage collector frees the programmer from worrying about . . . . . . . .
  ক

  Dangling pointers

  খ

  Creating new objects

  গ

  Memory leak

  ঘ

  Segmentation errors
• In the function realloc(), if the new size of the memory block is larger than the old size, then the added memory . . . . . . . .
  ক

  is initialized to junk values

  খ

  is initialized to zero

  গ

  results in an error

  ঘ

  is not initialized
• What will happens if the statement free(a) is removed in the following C code?<br><pre><code class="c-program">#include&lt;stdio.h&gt;#include&lt;stdlib.h&gt;main(){ int *a; a=(int*)malloc(sizeof(int)); *a=100; printf("*a%d",*a); free(a); a=(int*)malloc(sizeof(int)); *a=200; printf("a%p",a); *a=200; printf("a%d",*a);}</code></pre>
  ক

  Error

  খ

  Memory leak

  গ

  Dangling pointer arises

  ঘ

  200 is printed as output
• What will be the error (if any) in the following C code?<br><pre><code class="c-program">#include&lt;stdio.h&gt;#include&lt;stdlib.h&gt;#include&lt;string.h&gt;int main(){ char *p; *p = (char)calloc(10); strcpy(p, "HELLO"); printf("%s", p); free(p); return 0;}</code></pre>
  ক

  No error

  খ

  Error in the statement: strcpy(p,"HELLO");

  গ

  Error in the statement: *p=(char)calloc(10);

  ঘ

  Error in the statement: free(p);
• A condition where in memory is reserved dynamically but not accessible to any of the programs is called . . . . . . . .
  ক

  Memory leak

  খ

  Dangling pointer

  গ

  Frozen memory

  ঘ

  Pointer leak
• If malloc() and calloc() are not type casted, the default return type is . . . . . . . .
  ক

  void*

  খ

  void**

  গ

  int*

  ঘ

  char*
• The following C code is an example of . . . . . . . .<br><pre><code class="c-program">#include&lt;stdio.h&gt;#include&lt;stdlib.h&gt;#include&lt;string.h&gt;main(){ char *p,*q; p=(char*)malloc(3*sizeof(char)); q=p; strcpy(p,"hello"); printf("p=%s",p); printf("q=%s",q); free(q); q=NULL; gets(p); gets(q); printf("%s",p); printf(“%s”,q);}</code></pre>
  ক

  Memory leak

  খ

  Dangling pointer

  গ

  Static memory allocation

  ঘ

  Linked list
• If the space in memory allocated by malloc is not sufficient, then an allocation fails and returns . . . . . . . .
  ক

  NULL pointer

  খ

  Zero

  গ

  Garbage value

  ঘ

  The number of bytes available
• Local variables are stored in an area called . . . . . . . .
  ক

  Heap

  খ

  Permanent storage area

  গ

  Free memory

  ঘ

  Stack
• When the pointer is NULL, then the function realloc is equivalent to the function . . . . . . . .
  ক

  malloc

  খ

  calloc

  গ

  free

  ঘ

  alloc
• The free() function frees the memory state pointed to by a pointer and returns . . . . . . . .
  ক

  the same pointer

  খ

  the memory address

  গ

  no value

  ঘ

  an integer value
• Array is preferred over linked list for the implementation of . . . . . . . .
  ক

  Radix sort

  খ

  Insertion sort

  গ

  Binary search

  ঘ

  Polynomial evaluation
• With every use of a memory allocation function, what function should be used to release allocated memory, which is no longer needed?
  ক

  unalloc()

  খ

  dropmem()

  গ

  dealloc()

  ঘ

  release()

  ঙ

  free()
• The number of arguments for realloc() function is/are:
  ক

  0

  খ

  1

  গ

  2

  ঘ

  3

  ঙ

  Depends upon user choice.
• What is a memory fragment in C?
  ক

  Unused memory between allocated blocks

  খ

  A type of data structure

  গ

  A reserved portion of memory

  ঘ

  A function to allocate memory
• In C, what is the purpose of the 'realloc' function?
  ক

  To change the size of a previously allocated block of memory

  খ

  To allocate memory for a structure

  গ

  To copy memory

  ঘ

  To check for memory leaks
• Which function is used to release all dynamically allocated memory in C?
  ক

  clearall()

  খ

  deallocateall()

  গ

  freeall()

  ঘ

  clearmemory()
• What is the difference between 'free' and 'delete' in C?
  ক

  'free' is used for dynamic memory, 'delete' is used for static memory

  খ

  'free' is used for dynamic memory, 'delete' is used for freeing memory

  গ

  'free' is used for C, 'delete' is used for C++

  ঘ

  'free' is used for static memory, 'delete' is used for dynamic memory
• Which function is used to allocate memory for a structure in C?
  ক

  malloc()

  খ

  structurealloc()

  গ

  structalloc()

  ঘ

  calloc()
• What is the primary advantage of using dynamic memory allocation in C?
  ক

  Flexibility to allocate memory at runtime

  খ

  Faster execution of programs

  গ

  Smaller memory footprint

  ঘ

  Elimination of memory leaks
• What happens if you attempt to free the same block of memory twice in C?
  ক

  It leads to undefined behavior

  খ

  The program terminates

  গ

  Memory is released, but the pointer remains valid

  ঘ

  Memory is leaked
• In C, which function is used to allocate memory from the stack?
  ক

  alloc()

  খ

  stackalloc()

  গ

  malloc()

  ঘ

  calloc()
• What is the difference between 'malloc' and 'calloc' in C?
  ক

  'malloc' allocates uninitialized memory, 'calloc' allocates and initializes to zero

  খ

  'malloc' allocates and initializes to zero, 'calloc' allocates uninitialized memory

  গ

  'malloc' is used for arrays, 'calloc' is used for single elements

  ঘ

  'malloc' allocates memory from the stack, 'calloc' allocates from the heap
• What is the maximum number of bytes that can be allocated using 'malloc' in C?
  ক

  It depends on the system and available memory

  খ

  2^16 bytes

  গ

  2^32 bytes

  ঘ

  2^64 bytes