Miscellaneous On Data Structures - Study Mode
[#871] Consider the following number of activities with their start and finish time given below. Which of following activity will be left out? Activity Starting time Finish time A1 1 2 A2 3 5 A3 4 6 A4 5 8
Correct Answer
(C) A3
[#872] What is the maximal independent set for the graph given below?
Correct Answer
(B) {A, C, D, F}
[#873] Affine cipher is not susceptible to frequency analysis.
Correct Answer
(B) false
[#874] . . . . . . . . has the lowest fault rate of all the page replacement algorithms.
Correct Answer
(A) Optimal page replacement algorithm
[#875] What is the minimum cut of the following network?
Correct Answer
(A) ({1,3},{4,3},{4,5})