Problem 2: Sticks and Stones
Sahil Bhalla and Selim Zoorob
Prompt
Using Sticks on seesaws to create various logic gates and circuits
0
1
1
0
OR, AND, XOR, and NOT Gates
How do we make two input gates out of toothpicks on a 2D plane?
The 10 = 01 Simplification
4-Bit Adder
A Full Adder Adds two bits (plus a carray) and computes the sum and carry out
S = A XOR B XOR Cin
Cout = A AND B OR Cin AND (A XOR B)
4-Bit is just Full Adder 4 Times
1 Bit Adder and physical design of other logic gates
Add 0 1
What do we get?
D = 1
S = 1
E = 0
F = 0
C out = 0
Final results:
S=1
C = 0 (by default)
C out = 0
Programming Framework
-Example Calculation through each step of the 4-bit adder
-Gates modelled after toothpick design to simulate
2x1 MUX and 1 bit adder: Script testing
2-1 MUX
Chooses Between two inputs based on selector input
Using this formula we can prototype the MUX in code
2-1 MUX Design
40cm
40cm
Input of 0 1 1 in the 2x1 MUX:
We obtain 1 (Y=1)
Conclusions
Sources: