Gate CS-2016-1 Question Paper With Solutions

Q. 43 Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is

(A) Θ(1)

(B) Θ(Log (n))

(C) Θ(√ n)

(D) Θ(n)

Answer: (B)

Explanation:

Gate CS-2016-1 Question Paper With Solutions

Learn More:   Gate EE-2008 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here