GATE | GATE CS 1999 | Question 16

If n is a power of 2, then the minimum number of multiplications needed to compute an   is:
(A) log2n
(B) √n
(C) n-1
(D) n


Answer: (A)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.