Miscellaneous On Data Structures - Study Mode
[#401] What is the total running time of Euclid's algorithm?
Correct Answer
(A) O(N)
[#402] . . . . . . . . is the class of decision problems that can be solved by non-deterministic polynomial algorithms.
Correct Answer
(A) NP
[#403] What is the following expression, lcm (a, gcd (a, b)) equal to?
Correct Answer
(A) a
[#404] What will be time complexity when binary search is applied on a linked list?
Correct Answer
(B) O(n)
[#405] Which happens if the fast-moving pointer(hare) reaches the tail of the linked list?
Correct Answer
(D) No cycle exists in the linked list