Recursion MCQ

Test your knowledge with important Recursion MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Recursion MCQs at Bissoy

• What value will assigned, if there is no argument marked by a matching keyword?
  ক

  T

  খ

  NIL

  গ

  False

  ঘ

  Both NIL & False
• Which can appear without an initial form?
  ক

  Parameter

  খ

  Block parameter

  গ

  Optional parameter

  ঘ

  Aux parameter
• Which eliminate the need for many auxiliaries?
  ক

  Parameters

  খ

  Block parameters

  গ

  Optional parameters

  ঘ

  All of the mentioned
• Which allow procedures to use themselves again?
  ক

  Recursion

  খ

  Reuse

  গ

  Reintiate

  ঘ

  None of the mentioned
• Which is bounded to a list of all unaccounted argument values?
  ক

  REST

  খ

  &REST

  গ

  RAISE

  ঘ

  &RAISE
• If the height of a binary tree is 54, how many null pointers are there as children?
  ক

  1267

  খ

  358

  গ

  56

  ঘ

  255
• Every recursive algorithm must have the problem of ________
  ক

  overhead of repeated function calls

  খ

  collision of different function calls

  গ

  searching for all duplicate elements

  ঘ

  make only two recursive calls
• Which of the following functions generates new data at each step of a method?
  ক

  corecursive function

  খ

  structural recursive function

  গ

  unirecursive function

  ঘ

  indirect function
• In which of the following problems recurrence relation holds?
  ক

  Optimal substructure

  খ

  Tower of Hanoi

  গ

  Hallmark substitution

  ঘ

  Longest common subsequence
• The mutual recursion is also termed as ______
  ক

  indirect recursion

  খ

  constructive recursion

  গ

  generative recursion

  ঘ

  definitive recursion
• The argument of each recursive call is the content of a field of the original output. This definite characteristic belongs to which of the following function?
  ক

  Structurally recursive function

  খ

  Generativity recursive function

  গ

  General function

  ঘ

  Indirect recursive function
• _______ recursion consists of multiple self-references.
  ক

  binary recursion

  খ

  single recursion

  গ

  multiple recursion

  ঘ

  coinductive recursion
• How many types of self-referential recursive data are there in computer programs?
  ক

  6

  খ

  2

  গ

  10

  ঘ

  4
• ________ is the consequence of dynamic programming.
  ক

  Bellman equation

  খ

  Frobenius equation

  গ

  Linear equation

  ঘ

  Boolean expression
• Which of the following is contained in a recursive grammar?
  ক

  semantic rules

  খ

  production rules

  গ

  recursive language

  ঘ

  recursive function
• Which of these is not true about recursion?
  ক

  Making the code look clean

  খ

  A complex task can be broken into sub-problems

  গ

  Recursive calls take up less memory

  ঘ

  Sequence generation is easier than a nested iteration
• What happens if the base condition isn’t defined in recursive programs?
  ক

  Program gets into an infinite loop

  খ

  Program runs once

  গ

  Program runs n number of times where n is the argument given to the function

  ঘ

  An exception is thrown
• Recursion and iteration are the same programming approach.
  ক

  True

  খ

  False
• Which of the following statements is false about recursion?
  ক

  Every recursive function must have a base case

  খ

  Infinite recursion can occur if the base case isn’t properly mentioned

  গ

  A recursive function makes the code easier to understand

  ঘ

  Every recursive function must have a return value
• What is tail recursion?
  ক

  A recursive function that has two base cases

  খ

  A function where the recursive functions leads to an infinite loop

  গ

  A recursive function where the function doesn’t return anything and just prints the values

  ঘ

  A function where the recursive call is the last thing executed by the function
• Which of these is false about recursion?
  ক

  Recursive function can be replaced by a non-recursive function

  খ

  Recursive functions usually take more memory space than non-recursive function

  গ

  Recursive functions run faster than non-recursive function

  ঘ

  Recursion makes programs easier to understand
• Only problems that are recursively defined can be solved using recursion.
  ক

  True

  খ

  False
• Which is the most appropriate definition for recursion?
  ক

  A function that calls itself

  খ

  A function execution instance that calls another execution instance of the same function

  গ

  A class method that calls another class method

  ঘ

  An in-built method that is automatically called
• Which of these will happen if recursive method does not have a base case?
  ক

  An infinite loop occurs

  খ

  System stops the program after some time

  গ

  After 1000000 calls it will be automatically stopped

  ঘ

  None of the mentioned
• What is Recursion in Java?
  ক

  Recursion is a class

  খ

  Recursion is a process of defining a method that calls other methods repeatedly

  গ

  Recursion is a process of defining a method that calls itself repeatedly

  ঘ

  Recursion is a process of defining a method that calls other methods which in turn call again this method
• Which of these data types is used by the operating system to manage the Recursion in Csharp?
  ক

  Array

  খ

  Queue

  গ

  Tree

  ঘ

  Stack
• Which of these is not a correct statement?
  ক

  A recursive method must have a base case

  খ

  Recursion always uses stack

  গ

  Recursion is always managed by C# Runtime environment

  ঘ

  Recursive methods are faster that programmer written loop to call the function repeatedly using a stack
• Which of these will happen if the recursive method does not have a base case?
  ক

  Infinite loop condition occurrence

  খ

  System gets hanged

  গ

  After 10000 executions program will be automatically stopped

  ঘ

  None of the mentioned
• What is Recursion in CSharp defined as?
  ক

  Recursion is another form of class

  খ

  Recursion is another process of defining a method that calls other methods repeatedly

  গ

  Recursion is a process of defining a method that calls itself repeatedly

  ঘ

  Recursion is a process of defining a method that calls other methods which in turn calls this method
• Iteration requires more system memory than recursion.
  ক

  True

  খ

  False