Miscellaneous On Data Structures - Study Mode
[#281] In a graph, every maximum matching is a maximal matching.
Correct Answer
(A) True
[#282] The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency.
Correct Answer
(A) true
[#283] Backtracking algorithm is faster than the brute force technique
Correct Answer
(A) true
[#284] What does Maximum flow problem involve?
Correct Answer
(A) finding a flow between source and sink that is maximum
[#285] Pseudo random number generators can be used for data encryption.
Correct Answer
(B) false