- Courses
- Tutorials
- Practice
- Jobs
Top MCQs on Algorithms | DSA Quiz for Beginners
Question 1
What is the situation known as when a key different than the one required is maintained at the specified location?
- A
Collision
- B
Hashing
- C
Chaining
- D
Open Addressing
Question 2
what type of additional memory is required for each recursive call.
- A
Queue memory
- B
heap memory
- C
stack memory
- D
None
Question 3
Dynamic Programming (DP) is defined as a technique that solves some particular type of problems in ....time
- A
Quadratic
- B
Polynomial
- C
Linear
- D
none
Question 4
How long does it take to calculate the nth Fibonacci number using dynamic programming?
- A
O(n^2)
- B
O(log n)
- C
O(n)
- D
O(2^n)
Question 5
When the solutions to the same subproblems are needed repetitively for solving the actual problem, is callled.....
- A
Overlapping Subproblems
- B
recursive problems
- C
Optimal problem
- D
None
Question 6
The method used in dynamic programming to save previously calculated data is known as _______.
- A
Mapping
- B
Saving value property
- C
Memoization
- D
None
Question 7
Backtracking problems take time complexity ......
- A
high time complexity
- B
Low time complexity
- C
Both
- D
None
Question 8
Backtracking is generally a method for resolving______ problems.
- A
Numerical problems
- B
Exhaustive search
- C
Combinatorial problems
- D
Graph coloring problems
Question 9
Which of the following is not a backtracking algorithm?
- A
Knight tour problem
- B
N queen problem
- C
Tower of Hanoi
- D
M coloring problem
Question 10
The stack's ____ determines how many recursive calls are allowed.
- A
size
- B
time
- C
Quality
- D
None
There are 30 questions to complete.