Miscellaneous On Data Structures - Study Mode

Show All Answers

[#731] Bifid square combines autokey square with transposition.

(A) true

(B) false

Correct Answer

(B) false

[#732] Given items as {value,weight} pairs {{40, 20},{30, 10},{20, 5}}. The capacity of knapsack=20. Find the maximum value output assuming items to be divisible.

(A) 60

(B) 80

(C) 100

(D) 40

Correct Answer

(A) 60

[#733] A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)

(A) 100

(B) 140

(C) 80

(D) 20

Correct Answer

(A) 100

[#734] Which of the following best represents the time complexity for inserting an element in coalesced hashing?

(A) O(n)

(B) O(1)

(C) O(n 2 )

(D) O(n log n)

Correct Answer

(B) O(1)

[#735] Which of the following is not an application of inclusion-exclusion principle?

(A) Counting intersections

(B) Graph coloring

(C) Matching of bipartite graphs

(D) Maximum flow problem

Correct Answer

(D) Maximum flow problem