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.
You should maybe test all the truth table no ?
Try some logic... Instead of hard code...
814 Solvers
13270 Solvers
Generate N equally spaced intervals between -L and L
396 Solvers
287 Solvers
285 Solvers