GATE | GATE-CS-2003 | Question 11

Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is
(A) Θ(1)
(B) Θ(log n)
(C) Θ(n)
(D) Θ(n2)

Answer: (C)

Explanation: Number of gates used in ‘n’ bit array multiplier (n * n) = (2n – 1)

Each gate in the circuit has a unit delay.

Total delay = 1 * (2n – 1 ) = O(2n – 1) = O(n)

Thus, option (C) is correct.

Please comment below if you find anything wrong in the above post.

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.