Miscellaneous On Data Structures - Study Mode

Show All Answers

[#926] How many recursive calls are there in Recursive matrix multiplication through Simple Divide and Conquer Method?

(A) 2

(B) 6

(C) 9

(D) 8

Correct Answer

(D) 8

[#927] The graph which contains eulerian tour, is called an euler graph.

(A) True

(B) False

Correct Answer

(A) True

[#928] What is the worst case time complexity of dynamic programming solution of the subset sum problem(sum=given subset sum)?

(A) O(n)

(B) O(sum)

(C) O(n 2 )

(D) O(sum*n)

Correct Answer

(D) O(sum*n)

[#929] Pigpen cipher is not susceptible to frequency analysis.

(A) True

(B) False

Correct Answer

(B) False

[#930] Trithemius cipher is a special case of . . . . . . . .

(A) autokey cipher

(B) vigenere cipher

(C) hill cipher

(D) route cipher

Correct Answer

(B) vigenere cipher