M
Q. What is the GCD of a and b?
Explanation by: Mr. Dubey
as per euclid’s algorithm, gcd (a, b) = gcd (a-b, b) if a > b or gcd (a, b) = gcd (a, b-a) if b > a.
You must be Logged in to update hint/solution
Related MCQs
Q. Identity correct equation of Jacard Coefficient:
Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5
Q. Which challenge comes when we use many devices on the same network?
Q. Type of dataset available in Supervised Learning is
Q. Which NetWare protocol works on layer 3–network layer—of the OSI model?
Q. All system calls return ……..if open or create call fails
Q. What is the space complexity of Kadane’s algorithm?
Q. The time needed for an output to change from the result of an input change is known as:
Question analytics
Discusssion
Login to discuss.