# Truth Tables and De Morgan's Rules

## 1. Truth Tables and De Morgan's Rules

Boolean expressions are used to control branches and loops in computer programs. Of course, branches and loops are fundamental to programming. This chapter shows some methods for working with boolean expressions.

**Truth tables** are used to analyze boolean expressions.

**De Morgan's** rules transform confusing boolean expressions into easier ones.

**Chapter Topics:**

- Truth Tables
- De Morgan's Rules

**Question 1:**

(Review :) What is the value of: `x<12 && y>10`

Assume that `x`

contains 9 and `y`

contains 7.

Source: Bradley Kjell, http://programmedlessons.org/Java9/chap33/ch33_01.html

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 License.