For an n-bit binary adder, what is the number of gates through which a carry has to propagate from input to output?

This question was previously asked in
ESE Electronics 2016 Paper II: Official Paper
View all UPSC IES Papers >
  1. n
  2. 2n
  3. n2
  4. n + 1

Answer (Detailed Solution Below)

Option 2 : 2n
Free
ST 1: UPSC ESE (IES) Civil - Building Materials
6.2 K Users
20 Questions 40 Marks 24 Mins

Detailed Solution

Download Solution PDF

Binary full adder circuit is as shown:

F2 Shubham 21-9-2020 Swati D 8

To add two one-bit numbers, along with carrying bit, only two gates are required to propagate carry from input to output.

Therefore, for an n-bit binary adder, 2n number of gates through which a carry has to propagate from input to output.

Latest UPSC IES Updates

Last updated on May 28, 2025

->  UPSC ESE admit card 2025 for the prelims exam has been released. 

-> The UPSC IES Prelims 2025 will be held on 8th June 2025.

-> The selection process includes a Prelims and a Mains Examination, followed by a Personality Test/Interview.

-> Candidates should attempt the UPSC IES mock tests to increase their efficiency. The UPSC IES previous year papers can be downloaded here.

Get Free Access Now
Hot Links: teen patti star apk teen patti bodhi teen patti win lucky teen patti