Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE CS 1999 | Question 16

  • Last Updated : 06 Oct, 2017

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

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :