Computer Sciences > Gate 2016 Set-1 > Full Adder
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)

Correct : Full Adder

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......