Miscellaneous On Data Structures - Study Mode
[#836] A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
Correct Answer
(A) Number of vertices in U=Number of vertices in V
[#837] Which of the following algorithm can be used for finding articulation points in a graph?
Correct Answer
(C) Tarjan's algorithm
[#838] What is the efficiency of Gale-Shapley algorithm used in stable marriage problem?
Correct Answer
(C) O(N 2 )
[#839] Dinic's algorithm runs faster than the Ford-Fulkerson algorithm.
Correct Answer
(A) true
[#840] What is the usual size of polybius square used for encrypting English alphabets?
Correct Answer
(A) 5 X 5