M

Mr. Dubey • 100.69K Points
Coach

Q. What is the computational complexity of Binary GCD algorithm where a and b are integers?

  • (A) o (log a + log b)2)
  • (B) o (log (a + b))
  • (C) o (log ab)
  • (D) o (log a-b)
Share
Explanation by: Mr. Dubey
from the binary gcd algorithm, it is found that the computational complexity is o (log a + log b)2) as the total number of steps in the execution is at most the total sum of number of bits of a and b.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. A chronological record of relevant details about the execution of tests is called as, a _______

Q. Which of the following is not an example of a business process?

Q. There are 6 equally spaced points A, B, C, D, E and F marked on a circle with radius R. How many convex heptagons of distinctly different areas can be

Q. Which of the following data structure can't store the non-homogeneous data element?

Q. Which protocol standard of serial communication specify the bi-directional and half-duplex form of data transmission by allowing various numbers of dr

Q. Two MPI_Irecv calls are made specifying different buffers and tags, but the same sender and request location. How can one determine that the buffer sp

Q. When the target thread periodically checks if it should terminate and terminates itself in an orderly manner, it is called?

Q. Which of the following options are correct in terms of wavelength for the different types of IR spectrometer?

Q. Variables declared in the body of a particular member function are known as data members and can be used in all member functions of the class.

Q. 29 input circuit will have total of

Question analytics