Miscellaneous On Data Structures - Study Mode

[#466] Consider the graph given below, print the eulerian circuit of the graph using fleury's algorithm?
Correct Answer

(B) DABDC

[#467] For a graph of degree three, in what time can a Hamiltonian path be found?
Correct Answer

(A) O(0.251 n )

[#468] What is the competitive analysis of the FIFO algorithm?
Correct Answer

(D) k/(k-h+1)

[#469] Which of the following is a difference between running key cipher and vigenere cipher?
Correct Answer

(C) in vigenere cipher the key is repeated whereas in running key cipher key is not repeated

[#470] Which of the following is a characteristic of random page replacement algorithm?
Correct Answer

(C) It eliminates the overhead cost of tracking page reference