Miscellaneous On Data Structures - Practice Test

(A) McVitie and Wilson

(B) Gale

(C) Ford and Fulkerson

(D) Dinitz

(A) McVitie and Wilson

(A) No. of partitions are divisible by 5 for a number 3 more than a multiple of 5

(B) No. of partitions are divisible by 5 for a number 4 more than a multiple of 5

(C) No. of partitions are divisible by 5 for a number 2 more than a multiple of 5

(D) No. of partitions are divisible by 5 for a number 1 more than a multiple of 5

(B) No. of partitions are divisible by 5 for a number 4 more than a multiple of 5

(A) the recursive solution has a time complexity of O(2n)

(B) there is no known solution that takes polynomial time

(C) the recursive solution is slower than dynamic programming solution

(D) the dynamic programming solution has a time complexity of O(n log n)

(D) the dynamic programming solution has a time complexity of O(n log n)

(A) O(n log n)

(B) O(n 2 )

(C) O(n)

(D) O(log n)

(C) O(n)

(A) Substitution cipher

(B) Transposition cipher

(C) Mono alphabetic cipher

(D) PKCS cipher

(D) PKCS cipher

Miscellaneous On Data Structures - Study Mode