Dynamic Programming In Data Structures - Practice Test

(A) O(1)

(B) O(n)

(C) O(n 2 )

(D) None of the mentioned

(A) O(1)

(A) {0,1,2,3}

(B) {-1,0,1}

(C) {-1,-2,-3,0}

(D) {-4,-3,-2,-1}

(D) {-4,-3,-2,-1}

(A) Optimal substructure

(B) Overlapping subproblems

(C) Greedy approach

(D) Both optimal substructure and overlapping subproblems

(D) Both optimal substructure and overlapping subproblems

(A) O(n)

(B) O(1)

(C) O(n!)

(D) O(n 2 )

(B) O(1)

(A) O(N)

(B) O(S)

(C) O(N 2 )

(D) O(S*N)

(B) O(S)

Dynamic Programming In Data Structures - Study Mode