Dynamic Programming In Data Structures - Study Mode

Show All Answers

[#146] What is the time complexity of the above dynamic programming implementation of the assembly line scheduling problem?

(A) O(1)

(B) O(n)

(C) O(n 2 )

(D) O(n 3 )

Correct Answer

(B) O(n)

[#147] Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?

(A) Brute force

(B) Dynamic programming

(C) Recursion

(D) Brute force, Dynamic programming and Recursion

Correct Answer

(D) Brute force, Dynamic programming and Recursion

[#148] For a given array, there can be multiple ways to reach the end of the array using minimum number of jumps.

(A) True

(B) False

Correct Answer

(A) True

[#149] Which of the following methods can be used to solve the Knapsack problem?

(A) Brute force algorithm

(B) Recursion

(C) Dynamic programming

(D) Brute force, Recursion and Dynamic Programming

Correct Answer

(D) Brute force, Recursion and Dynamic Programming

[#150] You have 2 dice each of them having 6 faces numbered from 1 to 6. What is the number of ways in which a sum of 11 can be achieved?

(A) 0

(B) 1

(C) 2

(D) 3

Correct Answer

(C) 2