Miscellaneous On Data Structures - Study Mode

Show All Answers

[#506] Consider the fleury's algorithm given below. Which of the following best suits the blank? Graph must have 0 or 2 odd vertices
if there are 0 odd vertices, start from any vertex
if there are 2 odd vertices, start from any one of them
follow any of the edge, always choose the ______________
repeat for all the edges of the graph

(A) non-bridge over the bridge

(B) bridge over non-bridge

(C) adjacent edges

(D) opposite edges

Correct Answer

(A) non-bridge over the bridge

[#507] Vertex coloring and chromatic number are one and the same.

(A) True

(B) False

Correct Answer

(B) False

[#508] Which algorithm can be used to find an eulerian cycle in a graph?

(A) Fleury's algorithm

(B) Tarjan's algorithm

(C) Hirschberg's algorithm

(D) Hungarian algorithm

Correct Answer

(A) Fleury's algorithm

[#509] What is the time complexity of Heap's algorithm?

(A) O(n log n)

(B) O(n 2 )

(C) O(n*n!)

(D) O(n!)

Correct Answer

(D) O(n!)

[#510] What will be the plain text corresponding to cipher text "RSEADC" if with the number of columns are given to be 3 and route of reading is down the columns?

(A) SACRED

(B) DERSAC

(C) REDSAC

(D) SEDRAC

Correct Answer

(C) REDSAC