Miscellaneous On Data Structures - Study Mode
[#186] Which of the following algorithm can be used to find the minimum cut of a connected graph?
Correct Answer
(C) Karger's algorithm
[#187] For an euler tour of a tree, how many vertices are required to store euler tour?
Correct Answer
(A) 2 * V - 1
[#188] Which type of flooding doesn't send every incoming packet on every outgoing line?
Correct Answer
(B) Selective flooding
[#189] In how many directions do queens attack each other?
Correct Answer
(C) 3
[#190] How many permutations will be formed from the array arr={1, 2, 3}?
Correct Answer
(C) 6