Dynamic Programming in Data Structures MCQ question and answer with solution

A. A table (array) to store subproblem results.

B. Recursion with memoization.

C. Iterative loops to build up solutions.

D. A stack

A. Each item can be included a limited number of times.

B. Each item can be included exactly once.

C. There are no restrictions on item inclusion.

D. The knapsack has a fixed size.

A. It works only for linear problems.

B. It simplifies problem decomposition.

C. It uses more memory.

D. It avoids recursion and builds solutions iteratively.

A. A stack

B. A queue

C. A 2D array

D. A linked list

A. Binary Search

B. Fibonacci sequence

C. Depth-First Search

D. Binary Search

A. Greedy Approach

B. Sorting

C. Memoization

D. Binary Search

A. A method for sorting elements.

B. A technique for recursion.

C. A global variable for storing results.

D. A data structure used to store subproblem results.

A. O(1)

B. O(n log n)

C. O(n²)

D. O(n)

A. Bottom-Up Approach

B. Divide and Conquer

C. Greedy Approach

D. Top-Down Approach

A. Bottom-Up builds the solution iteratively from base cases; Top-Down uses recursion with memoization.

B. Bottom-Up uses recursion; Top-Down builds solutions iteratively.

C. Bottom-Up is used for sorting; Top-Down is for searching.

D. There is no difference between them.