Consider a carry lookahead adder for adding two \(n\)-bit integers, built…

GATE · 2016 · CS · Set 1 · Computer Science & IT

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

  1. A.

    Θ(1)\Theta (1)

  2. B.

    Θ(log⁡(n))\Theta (\log(n))

  3. C.

    Θ(n)\Theta (\sqrt{n})

  4. D.

    Θ(n)\Theta (n)

Attempted by 702 students.

Sign up free to check your answer

Sign up free

Explore the full course: Isro

Loading lesson…