Miscellaneous On Data Structures - Study Mode
[#906] What will be the time complexity of the code to find a minimum element from an array of size n and uses square root decomposition(exclude pre processing time)?
Correct Answer
(A) O(√n)
[#907] Which of the following problems is not NP complete?
Correct Answer
(D) Halting problem
[#908] What is the GCD of 20 and 12 using Euclid's algorithm?
Correct Answer
(C) 4
[#909] Beaufort cipher is an example of . . . . . . . .
Correct Answer
(B) poly-alphabetic cipher
[#910] What is the time complexity of the above code used to reverse a string?
Correct Answer
(B) O(n)