Example
A full adder adds two bits plus an incoming carry.
highlighted = computed this step
Build the concrete table
Compute the highlighted logic-table value.
A=0 B=0 Cin=0total=0 sum=0 carry=0
Build the concrete table
Compute the highlighted logic-table value.
A=0 B=0 Cin=0A=0 B=0 Cin=1total=0 sum=0 carry=0total=1 sum=1 carry=0
Build the concrete table
Compute the highlighted logic-table value.
A=0 B=0 Cin=0A=0 B=0 Cin=1A=0 B=1 Cin=0total=0 sum=0 carry=0total=1 sum=1 carry=0total=1 sum=1 carry=0
Build the concrete table
Compute the highlighted logic-table value.
A=0 B=0 Cin=0A=0 B=0 Cin=1A=0 B=1 Cin=0A=0 B=1 Cin=1total=0 sum=0 carry=0total=1 sum=1 carry=0total=1 sum=1 carry=0total=2 sum=0 carry=1
Build the concrete table
Compute the highlighted logic-table value.
A=0 B=0 Cin=0A=0 B=0 Cin=1A=0 B=1 Cin=0A=0 B=1 Cin=1A=1 B=0 Cin=0total=0 sum=0 carry=0total=1 sum=1 carry=0total=1 sum=1 carry=0total=2 sum=0 carry=1total=1 sum=1 carry=0
Build the concrete table
Compute the highlighted logic-table value.
A=0 B=0 Cin=0A=0 B=0 Cin=1A=0 B=1 Cin=0A=0 B=1 Cin=1A=1 B=0 Cin=0A=1 B=0 Cin=1total=0 sum=0 carry=0total=1 sum=1 carry=0total=1 sum=1 carry=0total=2 sum=0 carry=1total=1 sum=1 carry=0total=2 sum=0 carry=1
Build the concrete table
Compute the highlighted logic-table value.
A=0 B=0 Cin=0A=0 B=0 Cin=1A=0 B=1 Cin=0A=0 B=1 Cin=1A=1 B=0 Cin=0A=1 B=0 Cin=1A=1 B=1 Cin=0total=0 sum=0 carry=0total=1 sum=1 carry=0total=1 sum=1 carry=0total=2 sum=0 carry=1total=1 sum=1 carry=0total=2 sum=0 carry=1total=2 sum=0 carry=1
Build the concrete table
Compute the highlighted logic-table value.
A=0 B=0 Cin=0A=0 B=0 Cin=1A=0 B=1 Cin=0A=0 B=1 Cin=1A=1 B=0 Cin=0A=1 B=0 Cin=1A=1 B=1 Cin=0A=1 B=1 Cin=1total=0 sum=0 carry=0total=1 sum=1 carry=0total=1 sum=1 carry=0total=2 sum=0 carry=1total=1 sum=1 carry=0total=2 sum=0 carry=1total=2 sum=0 carry=1total=3 sum=1 carry=1
logic-computation
Every row is intentionally ordered and pinned to the lesson specification.