Find out sum and carry of a binary adder if previous carry is given with two bits (x and y) for addition.
Examples
Previous carry is 1 and x=y=1. Addition is 1 and carry is also 1.
Previous carry is 0 and x=y=1. Addition is 0 and carry is also 1.
Previous carry is 0 and x=1, y=0. Addition is 1 and carry is also 0.
Solution Stats
Problem Comments
-
1 Comment
Jean-Marie Sainthillier
on 20 Nov 2014
You should maybe test all the truth table no ?
Solution Comments
-
1 Comment
Pritesh Shah
on 19 Nov 2014
Try some logic... Instead of hard code...
Problem Recent Solvers109
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
320 Solvers
-
Arrange Vector in descending order
2001 Solvers
-
Back to basics 6 - Column Vector
814 Solvers
-
381 Solvers
-
Number of Even Elements in Fibonacci Sequence
433 Solvers
More from this Author70
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)