Top MCQs on Algorithms | DSA Quiz for Beginners
Last Updated :
Discuss
Comments
Question 1
What is the situation known as when a key different than the one required is maintained at the specified location?
Collision
Hashing
Chaining
Open Addressing
Question 2
what type of additional memory is required for each recursive call.
Queue memory
heap memory
stack memory
None
Question 3
Dynamic Programming (DP) is defined as a technique that solves some particular type of problems in ....time
Quadratic
Polynomial
Linear
none
Question 4
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 5
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 6
The method used in dynamic programming to save previously calculated data is known as _______.
Mapping
Saving value property
Memoization
None
Question 7
Backtracking problems take time complexity ......
high time complexity
Low time complexity
Both
None
Question 8
Backtracking is generally a method for resolving______ problems.
Numerical problems
Exhaustive search
Combinatorial problems
Graph coloring problems
Question 9
Which of the following is not a backtracking algorithm?
Knight tour problem
N queen problem
Tower of Hanoi
M coloring problem
Question 10
The stack's ____ determines how many recursive calls are allowed.
size
time
Quality
None
Tags:
There are 30 questions to complete.
Take a part in the ongoing discussion
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy