Miscellaneous On Data Structures - Study Mode

[#406] In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
Correct Answer

(C) Augmenting

[#407] Morse Code is named after which scientist?
Correct Answer

(A) Samuel F. B. Morse

[#408] Which one of the following is not an application of max-flow min-cut algorithm?
Correct Answer

(B) closest pair

[#409] What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
Correct Answer

(D) O(sum*n)

[#410] Which of the following refers to the minimum number of colors, with which the edges of the graph can be colored?
Correct Answer

(C) Edge chromatic number