CS-I Journal J1017: Binary Adders

Name: Anish Choudhury

Date: 24-Oct-2022

I received assistance from: Mrs. Jang

I assisted: NO ONE

Section 1

1.1: The AND GATE

1.2: The XOR GATE

Section 2

2.1: The top row is a XOR gate and the bottom row is a NOT XOR gate.

2.2: This is true because the out puts of the sum says so.

Section 3

3.1: Because it does not need a carry in.

3.2: No, because it has to go through all of the binary adders before getting the sum.

3.3: If C15 is high, it is probable that the answer is wrong.

What did I learn? What is the "big idea"?

I learned that computers use binary adders to do simple operations.

What challenges did I encounter?

I encountered challlenges when I got to the ripple carry adder part.

How could this experience be improved?

This experience could be improved by having this explained by a teacher.

Free Reflection: How has what I've learned affected my thinking?

I now realize that computers use binary adders to do simple operations.