Dynamic Programming In Data Structures - Study Mode

Show All Answers

[#151] Consider the strings "monday" and "tuesday". What is the edit distance between the two strings?

(A) 3

(B) 4

(C) 5

(D) 6

Correct Answer

(B) 4

[#152] Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?

(A) Dynamic programming

(B) Recursion

(C) Brute force

(D) Dynamic programming, Recursion, Brute force

Correct Answer

(D) Dynamic programming, Recursion, Brute force

[#153] What is the time complexity of the recursive implementation used to find the nth fibonacci term?

(A) O(1)

(B) O(n 2 )

(C) O(n!)

(D) Exponential

Correct Answer

(D) Exponential

[#154] The number of increasing subsequences with the longest length for the given sequence are: {10, 9, 8, 7, 6, 5}

(A) 3

(B) 4

(C) 5

(D) 6

Correct Answer

(D) 6

[#155] What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?

(A) O(1)

(B) O(2 n )

(C) O(n)

(D) O(n 2 )

Correct Answer

(B) O(2 n )