View source for 2.2.2 Truth Tables

Let's continue our journey into how computers make decisions by looking at '''Truth Tables'''!

=== 2.2.2 Truth Tables: The Rulebook for Logic Gates ===
Imagine you have a new game, and you want to know all the possible ways to play it and what happens in each situation. A '''Truth Table''' is kind of like that, but for logic gates!

'''What is a Truth Table?'''

A '''Truth Table''' is a special chart that shows '''all possible combinations of inputs''' to a logic gate (or a group of gates) and the '''resulting output''' for each combination.

Remember, in Boolean Algebra and with logic gates, inputs and outputs can only be '''True (1)''' or '''False (0)'''. A truth table systematically lists every single possibility, so you don't miss any.

'''Why are Truth Tables Important?'''

# '''Clear Rules:''' They provide a very clear and organized way to define exactly how a logic gate or a circuit (a combination of gates) will behave. It's like having a complete instruction manual.
# '''Predicting Behavior:''' If you know the inputs, you can always look at the truth table and instantly know what the output will be. This helps computer designers predict how their circuits will work.
# '''Troubleshooting:''' If a computer isn't doing what it's supposed to, engineers can use truth tables to check if the logic gates are behaving correctly or if there's a problem.

'''How to Read a Truth Table'''

Truth tables usually have columns for:

* All the different inputs (often labeled A, B, C, etc.).
* The final output (often labeled Q or X).

Each '''row''' in the table shows one unique combination of inputs and the output that results from that specific combination.

Let's look at some examples for the gates we just learned:

==== Example 1: NOT Gate Truth Table ====
A NOT gate has only one input (let's call it A) and one output (Q).
{| class="wikitable"
|Input (A)
|Output (Q)
|-
|0 (False)
|1 (True)
|-
|1 (True)
|0 (False)
|}
''This table clearly shows: if A is 0, Q is 1. If A is 1, Q is 0. It always reverses!''

==== Example 2: AND Gate Truth Table ====
An AND gate usually has two inputs (let's call them A and B) and one output (Q).
{| class="wikitable"
|Input (A)
|Input (B)
|Output (Q)
|-
|0 (False)
|0 (False)
|0 (False)
|-
|0 (False)
|1 (True)
|0 (False)
|-
|1 (True)
|0 (False)
|0 (False)
|-
|1 (True)
|1 (True)
|1 (True)
|}
''This table shows: Q is only 1 when BOTH A and B are 1. In all other cases, Q is 0.''

==== Example 3: OR Gate Truth Table ====
An OR gate also usually has two inputs (A and B) and one output (Q).
{| class="wikitable"
|Input (A)
|Input (B)
|Output (Q)
|-
|0 (False)
|0 (False)
|0 (False)
|-
|0 (False)
|1 (True)
|1 (True)
|-
|1 (True)
|0 (False)
|1 (True)
|-
|1 (True)
|1 (True)
|1 (True)
|}
''This table shows: Q is 1 if A is 1 OR B is 1 (or both). Q is only 0 when BOTH A and B are 0.''

'''Building More Complex Rules'''

Truth tables become even more powerful when you combine several logic gates to solve a bigger problem, like our "Can I watch a movie?" example. You could build a truth table for that whole rule, listing all combinations of "Homework Done" and "School Night" inputs, and showing the final "Can Watch Movie" output. It would show exactly when you get to watch a movie and when you don't!

So, truth tables are the organized way that computer scientists and engineers map out the behavior of all the tiny electronic decisions happening inside a computer.
----

=== Bibliography ===

* '''Truth Tables (General Explanation):'''
** "Truth Tables" from GeeksforGeeks. https://www.geeksforgeeks.org/logic-gates-and-truth-tables/
** "Logic Gates: Truth Tables, Boolean Algebra, and Digital Circuits" from study.com. https://study.com/academy/lesson/logic-gates-truth-tables-boolean-algebra-digital-circuits.html
** "Truth Tables" from SparkFun Learn. https://learn.sparkfun.com/tutorials/logic-gates/truth-tables
* '''Examples of Truth Tables for Specific Gates:'''
** "Logic Gates" from BBC Bitesize. https://www.bbc.co.uk/bitesize/guides/zx42wxs/revision/1
** "Boolean Algebra Basics - AND, OR, NOT, NAND, NOR, XOR Gates" from Tutorials Point. https://www.tutorialspoint.com/computer_fundamentals/computer_fundamentals_boolean_algebra.htm

Gemini can make mistakes, so