Boolean Algebra
Boolean algebra is the branch of algebra in which the values of the variables and constants have exactly two values: true and false, usually denoted 1 and 0 respectively.
The basic operators in Boolean algebra are and, or, and not. The secondary operators are exclusive or (often called xor) and exclusive nor (sometimes called equivalence). They are secondary in the sense that they can be composed from the basic operators.
 The and of two values is true only whenever both values are true. It is written as $xy$ or $x \cdot y$. The values of and for all possible inputs is shown in the following truth table:
[math]x[/math] [math]y[/math] [math]x y[/math] 0 0 0 0 1 0 1 0 0 1 1 1
 The or of two values is true whenever either or both values are true. It is written as $x+y$. The values of or for all possible inputs is shown in the following truth table:
[math]x[/math] [math]y[/math] [math]x + y[/math] 0 0 0 0 1 1 1 0 1 1 1 1
 The not of a value is its opposite; that is, the not of a true value is false whereas the not of a false value is true. It is written as $\overline{x}$ or $\neg{x}$. The values of not for all possible inputs is shown in the following truth table:
[math]x[/math] [math]\overline{x}[/math] 0 1 1 0
 The xor of two values is true whenever the values are different. It uses the $\oplus$ operator, and can be built from the basic operators: $x \oplus y = x \overline{y} + \overline{x} y$ The values of xor for all possible inputs is shown in the following truth table:
[math]x[/math] [math]y[/math] [math]x \oplus y[/math] 0 0 0 0 1 1 1 0 1 1 1 0
 The xnor of two values is true whenever the values are the same. It is the not of the xor function. It uses the $\odot$ operator: $x \odot y = \overline{x \oplus y}$. The xnor can be built from basic operators: $x \odot y = x y + \overline{x} \overline{y}$ The values of xnor for all possible inputs is shown in the following truth table:
[math]x[/math] [math]y[/math] [math]x \odot y[/math] 0 0 1 0 1 0 1 0 0 1 1 1
Just as algebra has basic rules for simplifying and evaluating expressions, so does Boolean algebra.
Why is Boolean Algebra Important for ACSL Students?
Boolean algebra is important to programmers, computer scientists, and the general population.
 For programmers, Boolean expressions are used for conditionals and loops. For example, the following snippet of code sums the even numbers that are not also multiples of 3, stopping when the sum hits 100:

s = 0 x = 1 while (s < 100): if (x % 2 == 0) and (x % 3 != 0): s = s + x x = x + 1
Both
s < 100
and(x % 2 == 0) and (x % 3 != 0)
are Boolean expressions.
 For computer scientists, Boolean algebra is the basis for digital circuits that make up a computer's hardware. The Digital Electronics category concerns a graphical representation of a circuit. That circuit is typically easiest to understand and evaluate by converting it to its Boolean algebra representation.
 The general population uses Boolean algebra, probably without knowing that they are doing so, when they enter search terms in Internet search engines. For example, the search expression "red sox yankees" is the Boolean expression
"red" and "sox" and not "yankees"
that will returns web pages that contain the words "red" and "sox", as long as it does not contain the word "yankees". The search expression "jaguar speed car" returns pages about the speed of the jaguar animal, not the Jaguar car.
Laws
A law of Boolean algebra is an identity such as [math]x + (y + z) = (x + y) + z[/math] between two Boolean terms, where a Boolean term is defined as an expression built up from variables, the constants 0 and 1, and operations and, or, not, xor, and xnor.
Like ordinary algebra, parentheses are used to group terms. When a not is represented with an overhead horizontal line, there is an implicit grouping of the terms under the line. That is, $x \cdot \overline{y + z}$ is evaluated as is it were written $x \cdot \overline{(y + z)}.$
Order of Precedence
The order of operator precedence is not; then and; then xor and xnor; and finally or. Operators with the same level of precedence are evaluated from lefttoright.
Fundamental Identities
Commutative Law – The order of application of two separate terms is not important.  $x+y = y+x$  $x \cdot y = y \cdot x$  
Associative Law – Regrouping of the terms in an expression doesn't change the value of the expression.  $(x + y) + z$ = $x + (y + z)$  $x \cdot (y \cdot z) = (x \cdot y) \cdot z$  
Idempotent Law – An term that is or'´ed or and´ed with itself is equal to that term.  $ x +x = x $  $x \cdot x = x$  
Annihilator Law – A term that is or'´ed with 1 is 1; a term and´ed with 0 is 0.  $x + 1 = 1$  $ x \cdot 0 = 0 $  
Identity Law – A term or´ed 0 or and´ed with a 1 will always equal that term.  $x + 0 = x$  $x \cdot 1 = x$  
Complement Law – A term or´ed with its complement equals 1 and a term and´ed with its complement equals 0.  $x + \overline{x} = 1 $  $x \cdot \overline{x} = 0$  
Absorptive Law – Complex expressions can be reduced to a simpler ones by absorbing like terms.  $x+(x \cdot y) = x$  $x \cdot (x+y) = x$  
Distributive Law – It's OK to multiply or factorout an expression.  $x \cdot (y + z) = xy + xz$  $x + yz = (x+y)(x+z)$  
DeMorgan's Law – An or (and) expression that is negated is equal to the and (or) of the negation of each term.  $\overline{x+y} = \overline{x} \cdot \overline{y}$  $\overline{x \cdot y} = \overline{x} + \overline{y}$  
Double Negation – A term that is inverted twice is equal to the original term.  $\overline{\overline{x}} = x $  
Relationship between XOR and XNOR  $ x\odot y = \overline{x\oplus y} = x \oplus \overline{y} =\overline{x} \oplus {y}$ 
Sample Problems
Problems in this category are typically of the form "Given a Boolean expression, simplify it as much as possible" or "Given a Boolean expression, find the values of all possible inputs that make the expression true."
Sample Problem 1: Simplify the Expression
Problem: Simplify the following expression as much as possible: $ \overline{ \overline{A(A+B)} + B\overline{A}}$
Solution:
The simplification proceeds as follows:
 $\overline{ \overline{A(A+B)} + B\overline{A}}$
[math]= \left(\overline{ \overline{A(A+B)}}\right) \cdot \left(\overline{ B\overline{A}}\right)[/math] (DeMorgan's Law) [math]= \left(A(A+B)\right) \cdot \left( \overline{B}+\overline{\overline{A}}\right)[/math] (Double Negation; DeMorgan's Law) [math]= A \cdot \left( \overline{B}+A\right)[/math] (Absorption; Double Negation) [math]=A[/math] (Absorption)
Sample Problem 2: Find Solutions
Problem: Find all orderd pairs $(A,B)$ that make the following expression true: $ \overline{ \overline{(A+B)} + \overline{A}B }$
Solution:
There are typically two approaches to solving this type of problem. One approach is to simplify the expression as much as possible, until it's obvious what the solutions are. The other approach is to create a truth table of all possible inputs, with columns for each subexpression.
The simplification approach is as following:
 $ \overline{\overline{(A+B)} + \overline{A}B}$
 $= \overline{\overline{A+B}} \cdot \overline{\overline{A}B}$
 $= (A+B) \cdot (\overline{\overline{A}}+\overline{B} ) $
 $= (A+B) \cdot (A+\overline{B}) $
 $= AA + A\overline{B} + BA + B\overline{B} $
 $= A + A(\overline{B} + B) + 0 $
 $= A + A(1)$
 $= A + A$
 $=A$
This means that all inputs are valid whenever $A$ is true: $(1,0)$ and $(1,1)$
The truth table approach is as following. Each column is the result of a basic operation on two other columns.
#1 #2 #3 #4 #5 #6 #7 #8 OR of Col#1, Col#2 NOT of Col#3 NOT of Col#1 ADD of Col#1, Col#2 OR of Col#4, Col#6 NOT of Col#7 [math]A[/math] [math]B[/math] [math]A+B[/math] [math]\overline{A+B}[/math] [math]\overline{A}[/math] [math]\overline{A}B[/math] [math]\overline{A+B} + \overline{A}B[/math] [math]\overline{\overline{A+B} + \overline{A}B}[/math] 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 0 1 0 1 0 0 0 0 1 1 1 1 0 0 0 0 1
The rightmost column is the expression we are solving; it is true for the 3rd and 4th rows, where the inputs are $(1,0)$ and $(1,1)$.
Online Resources
Websites
A great online tutorial on Boolean Algebra is part of Ryan's Tutorials.
Videos
The following YouTube videos show ACSL students and advisors working out some previous problems. To access the YouTube page with the video, click on the title of the video in the icon. (You can also play the video directly by clicking on the arrow in the center of the image; however, you'll probably want to have a larger viewing of the video since it contains writing on a whiteboard.) Some of the videos contain ads; ACSL is not responsible for the ads and does not receive compensation in any form for those ads.
ACSL Prep  Mrs. Gupta  Boolean Algebra (MegaChristian5555)
Christian is a student participating in ACSL. This video shows how to solve a halfdozen or so Boolean Algebra problems that have appeared in ACSL contests in recent years in the Intermediate and Senior divisions.  
ACSL Boolean Algebra Contest 2 Worksheet 1 (misterminich)
Mr. Minich is an ACSL advisor. This video was one of two he created to help prepare his students for the ACSL Boolean algebra category. It shows solutions to 5 different problems that have appeared in recent years.  
ACSL Boolean Algebra Contest 2 Worksheet 2 (misterminich)
Mr. Minich is an ACSL advisor. This video was one of two he created to help prepare his students for the ACSL Boolean algebra category. It shows solutions to 5 different problems that have appeared in recent years.  
ACSL 3 1314 #1  AM (Gordon Campbell)
This video walks through the solution to finding all ordered triples that make the following Boolean expression true:
This problem appeared in 20132014 in the Senior Division, Contest #3.  
ACSL 3 #1 1415  AM (Gordon Campbell)
This video walks through the simplification of the expression:
This problem appeared in 20142015 in the Senior Division, Contest #3.  
A general tutorial on boolean algebra that can be used for American Computer Science League. (Tangerine Code)
Walks through the simplification of the following Boolean expression:
</math> 