Dynamic Programming In Data Structures - Study Mode

Show All Answers

[#176] What is the edit distance between the strings "abcd" and "acbd" when the allowed operations are insertion, deletion and substitution?

(A) 1

(B) 2

(C) 3

(D) 4

Correct Answer

(B) 2

[#177] In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?

(A) 0

(B) 1

(C) 2

(D) 3

Correct Answer

(C) 2

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

(A) O(1)

(B) O(n)

(C) O(n 2 )

(D) O(n 3 )

Correct Answer

(A) O(1)

[#179] Find the length of the longest increasing subsequence for the given sequence: {-10, 24, -9, 35, -21, 55, -41, 76, 84}

(A) 5

(B) 4

(C) 3

(D) 6

Correct Answer

(D) 6

[#180] In which of the following cases will the edit distance between two strings be zero?

(A) When one string is a substring of another

(B) When the lengths of the two strings are equal

(C) When the two strings are equal

(D) The edit distance can never be zero

Correct Answer

(C) When the two strings are equal