diff --git a/src/lab/exp1/Theory.html b/src/lab/exp1/Theory.html
index bb00b7e5..f7dd1f6b 100644
--- a/src/lab/exp1/Theory.html
+++ b/src/lab/exp1/Theory.html
@@ -200,14 +200,14 @@
Full Adder
full adder adds two 1-bit binary numbers along with a carry brought
in and produces a sum and carry out as ouputs.1-bit full adder
adds three 1-bit numbers, often written as A, B, and Cin, where A
- and B are the operands, and Cin is a bit carried in from a âpastâ
+ and B are the operands, and Cin is a bit carried in from a past
addition.Circuit produces a 2-bit output sum typically
represented by the signals Cout and S, where the sum numerically
equals 2Cout + S . A full adder can be implemented in many different
ways using custom transistor-level circuits or using other gates.
S = A XOR
- B XOR Cin
Cout = (A AND
+ B XOR Cin
Cout = (A AND
B) OR (Cin AND
(A XOR B))
Truth Table
diff --git a/src/lab/exp10/Experiment.html b/src/lab/exp10/Experiment.html
index c220b864..22badd3c 100644
--- a/src/lab/exp10/Experiment.html
+++ b/src/lab/exp10/Experiment.html
@@ -99,8 +99,9 @@