Miscellaneous On Data Structures - Study Mode

[#566] . . . . . . . . is a family of combinatorial optimization problems in which a graph is partitioned into two or more parts with constraints.
Correct Answer

(B) graph partition

[#567] Which of the following graphs don't have chromatin number less than or equal to 2?
Correct Answer

(D) Wheel graph

[#568] Fractional knapsack problem can be solved in time O(n).
Correct Answer

(A) True

[#569] Which of the following best represents the time complexity to access an item in the least recently used cache?
Correct Answer

(B) O(1)

[#570] What will be the worst case time complexity of finding the sum of elements in a given range of (l,r) in an array of size n when we use square root optimization?
Correct Answer

(C) O(√n)