Miscellaneous On Data Structures - Study Mode
[#471] What is the runtime efficiency of using brute force technique for the closest pair problem?
Correct Answer
(C) O(N 2 )
[#472] What is the edge chromatic number for the graph given below?
Correct Answer
(C) 4
[#473] Consider a reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 of frame size 3. Using FIFO algorithm, determine the number of page faults.
Correct Answer
(D) 15
[#474] Which of the following is NOT a rule of tower of hanoi puzzle?
Correct Answer
(C) No disk should be placed over a larger disk
[#475] Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?
Correct Answer
(A) Yes