Top MCQs on Algorithms | DSA Quiz for Beginners

Question 21

The function solves a particular problem by calling a copy of itself and solving smaller subproblems of the original problems.

• hashing functions

• recursive function

• predefined function

• none

Question 22

The stack's ____ determines how many recursive calls are allowed.

• size

• time

• Quality

• None

Question 23

Which of the following is not a backtracking algorithm?

• Knight tour problem

• N queen problem

• Tower of Hanoi

• M coloring problem

Question 24

Backtracking is generally a method for resolving______ problems.

• Numerical problems

• Exhaustive search

• Combinatorial problems

• Graph coloring problems

Question 25

Backtracking problems take time complexity ......

• high time complexity

• Low time complexity

• Both

• None

Question 26

The method used in dynamic programming to save previously calculated data is known as _______.

• Mapping

• Saving value property

• Memoization

• None

Question 27

When the solutions to the same subproblems are needed repetitively for solving the actual problem, is callled.....

• Overlapping Subproblems

• recursive problems

• Optimal problem

• None

Question 28

How long does it take to calculate the nth Fibonacci number using dynamic programming?

• O(n^2)

• O(log n)

• O(n)

• O(2^n)

Question 29

Dynamic Programming (DP) is defined as a technique that solves some particular type of problems in ....time

• Quadratic

• Polynomial

• Linear

• none

Question 30

what type of additional memory is required for each recursive call.

• Queue memory

• heap memory

• stack memory

• None