Continueing asm tutorial from not and or, and xor gates

On binary addition

comparing binary

bin –  normal

0 –  0

1 – 1

10 – 2

11 – 3 .. ..

bin addition

0+0 = 0

1+0 = 1

0+1 = 1

1+1 = 10

101000
0000 0 +
————-
101010

now,
101
001+
————–
110

why?
1+1 = 10 0 and 1 carry. 1+0 = 1 then 1+0 = 1

now another
11
11
11+
—–

this one should get you knowing it

you can do it 2 ways
1) by (11+11)+11
(11+11) :
11
11+
———
first, unit, 1+1 we get 10 first digit is 0 we carry 1
1+1+1 1+1 is 10, 10+1 makes 11 so ans : 110
now we add 11 to 110
110
011+
——–

1001

2) by direct

1+1+1 = 10+1 = 11, we carry 1

now 1+1+1 +1

1+1+1 makes 11, plus one makes 100

100 and last was 1 1001

advice : write it on paper