বাইনারির যোগ উদাহরণ-১,,,,, একাদশ ও দ্বাদশ শ্রেণি।

Описание: Binary addition works similarly to decimal addition but follows the rules of base 2, where each digit is either a 0 or a 1. Here’s a step-by-step description:

1. *Align the Numbers:* Write the binary numbers to be added, aligning them by the rightmost digit.

2. *Start from the Rightmost Bit:*
Add the bits in each column starting from the rightmost one.
The possible outcomes are:
*0 + 0 = 0*
*0 + 1 = 1*
*1 + 0 = 1*
*1 + 1 = 10* (This is binary for 2; write down 0 and carry over 1 to the next column)

3. *Carry Over:* If the sum in a column is 2 (i.e., 10 in binary), write down 0 and carry over 1 to the next left column.

4. *Continue to the Left:* Repeat the addition for the next column to the left, including any carry from the previous column.

5. *Final Carry:* If there’s a carry left after adding the leftmost column, write it down as the most significant bit (the leftmost bit).

Example:
Consider adding two binary numbers: `1011` and `1101`.

```
1011
1101
--------
11000
```

Here’s how it works:
Add the rightmost bits: 1 + 1 = 10 (write 0, carry 1)
Next column: 1 + 0 + carry 1 = 10 (write 0, carry 1)
Next column: 0 + 1 + carry 1 = 10 (write 0, carry 1)
Last column: 1 + 1 + carry 1 = 11 (write 1, carry 1)
Write down the final carry 1 to get `11000` as the result.