<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.omnivision.website/index.php?action=history&amp;feed=atom&amp;title=2.2.2_Truth_Tables</id>
	<title>2.2.2 Truth Tables - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.omnivision.website/index.php?action=history&amp;feed=atom&amp;title=2.2.2_Truth_Tables"/>
	<link rel="alternate" type="text/html" href="https://wiki.omnivision.website/index.php?title=2.2.2_Truth_Tables&amp;action=history"/>
	<updated>2026-05-23T00:40:50Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.8</generator>
	<entry>
		<id>https://wiki.omnivision.website/index.php?title=2.2.2_Truth_Tables&amp;diff=69&amp;oldid=prev</id>
		<title>Mr. Goldstein: Created page with &quot;Let&#039;s continue our journey into how computers make decisions by looking at &#039;&#039;&#039;Truth Tables&#039;&#039;&#039;!  === 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 &#039;&#039;&#039;Truth Table&#039;&#039;&#039; is kind of like that, but for logic gates!  &#039;&#039;&#039;What is a Truth Table?&#039;&#039;&#039;  A &#039;&#039;&#039;Truth Table&#039;&#039;&#039; is a special chart that shows &#039;&#039;&#039;all possible combinations of inputs&#039;&#039;&#039; to a logic gate (...&quot;</title>
		<link rel="alternate" type="text/html" href="https://wiki.omnivision.website/index.php?title=2.2.2_Truth_Tables&amp;diff=69&amp;oldid=prev"/>
		<updated>2025-07-06T23:29:07Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Let&amp;#039;s continue our journey into how computers make decisions by looking at &amp;#039;&amp;#039;&amp;#039;Truth Tables&amp;#039;&amp;#039;&amp;#039;!  === 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 &amp;#039;&amp;#039;&amp;#039;Truth Table&amp;#039;&amp;#039;&amp;#039; is kind of like that, but for logic gates!  &amp;#039;&amp;#039;&amp;#039;What is a Truth Table?&amp;#039;&amp;#039;&amp;#039;  A &amp;#039;&amp;#039;&amp;#039;Truth Table&amp;#039;&amp;#039;&amp;#039; is a special chart that shows &amp;#039;&amp;#039;&amp;#039;all possible combinations of inputs&amp;#039;&amp;#039;&amp;#039; to a logic gate (...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Let&amp;#039;s continue our journey into how computers make decisions by looking at &amp;#039;&amp;#039;&amp;#039;Truth Tables&amp;#039;&amp;#039;&amp;#039;!&lt;br /&gt;
&lt;br /&gt;
=== 2.2.2 Truth Tables: The Rulebook for Logic Gates ===&lt;br /&gt;
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 &amp;#039;&amp;#039;&amp;#039;Truth Table&amp;#039;&amp;#039;&amp;#039; is kind of like that, but for logic gates!&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;What is a Truth Table?&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
A &amp;#039;&amp;#039;&amp;#039;Truth Table&amp;#039;&amp;#039;&amp;#039; is a special chart that shows &amp;#039;&amp;#039;&amp;#039;all possible combinations of inputs&amp;#039;&amp;#039;&amp;#039; to a logic gate (or a group of gates) and the &amp;#039;&amp;#039;&amp;#039;resulting output&amp;#039;&amp;#039;&amp;#039; for each combination.&lt;br /&gt;
&lt;br /&gt;
Remember, in Boolean Algebra and with logic gates, inputs and outputs can only be &amp;#039;&amp;#039;&amp;#039;True (1)&amp;#039;&amp;#039;&amp;#039; or &amp;#039;&amp;#039;&amp;#039;False (0)&amp;#039;&amp;#039;&amp;#039;. A truth table systematically lists every single possibility, so you don&amp;#039;t miss any.&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Why are Truth Tables Important?&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
# &amp;#039;&amp;#039;&amp;#039;Clear Rules:&amp;#039;&amp;#039;&amp;#039; 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&amp;#039;s like having a complete instruction manual.&lt;br /&gt;
# &amp;#039;&amp;#039;&amp;#039;Predicting Behavior:&amp;#039;&amp;#039;&amp;#039; 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.&lt;br /&gt;
# &amp;#039;&amp;#039;&amp;#039;Troubleshooting:&amp;#039;&amp;#039;&amp;#039; If a computer isn&amp;#039;t doing what it&amp;#039;s supposed to, engineers can use truth tables to check if the logic gates are behaving correctly or if there&amp;#039;s a problem.&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;How to Read a Truth Table&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Truth tables usually have columns for:&lt;br /&gt;
&lt;br /&gt;
* All the different inputs (often labeled A, B, C, etc.).&lt;br /&gt;
* The final output (often labeled Q or X).&lt;br /&gt;
&lt;br /&gt;
Each &amp;#039;&amp;#039;&amp;#039;row&amp;#039;&amp;#039;&amp;#039; in the table shows one unique combination of inputs and the output that results from that specific combination.&lt;br /&gt;
&lt;br /&gt;
Let&amp;#039;s look at some examples for the gates we just learned:&lt;br /&gt;
&lt;br /&gt;
==== Example 1: NOT Gate Truth Table ====&lt;br /&gt;
A NOT gate has only one input (let&amp;#039;s call it A) and one output (Q).&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|Input (A)&lt;br /&gt;
|Output (Q)&lt;br /&gt;
|-&lt;br /&gt;
|0 (False)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|-&lt;br /&gt;
|1 (True)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|}&lt;br /&gt;
&amp;#039;&amp;#039;This table clearly shows: if A is 0, Q is 1. If A is 1, Q is 0. It always reverses!&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
==== Example 2: AND Gate Truth Table ====&lt;br /&gt;
An AND gate usually has two inputs (let&amp;#039;s call them A and B) and one output (Q).&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|Input (A)&lt;br /&gt;
|Input (B)&lt;br /&gt;
|Output (Q)&lt;br /&gt;
|-&lt;br /&gt;
|0 (False)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|-&lt;br /&gt;
|0 (False)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|-&lt;br /&gt;
|1 (True)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|-&lt;br /&gt;
|1 (True)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|}&lt;br /&gt;
&amp;#039;&amp;#039;This table shows: Q is only 1 when BOTH A and B are 1. In all other cases, Q is 0.&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
==== Example 3: OR Gate Truth Table ====&lt;br /&gt;
An OR gate also usually has two inputs (A and B) and one output (Q).&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|Input (A)&lt;br /&gt;
|Input (B)&lt;br /&gt;
|Output (Q)&lt;br /&gt;
|-&lt;br /&gt;
|0 (False)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|-&lt;br /&gt;
|0 (False)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|-&lt;br /&gt;
|1 (True)&lt;br /&gt;
|0 (False)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|-&lt;br /&gt;
|1 (True)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|1 (True)&lt;br /&gt;
|}&lt;br /&gt;
&amp;#039;&amp;#039;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.&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Building More Complex Rules&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Truth tables become even more powerful when you combine several logic gates to solve a bigger problem, like our &amp;quot;Can I watch a movie?&amp;quot; example. You could build a truth table for that whole rule, listing all combinations of &amp;quot;Homework Done&amp;quot; and &amp;quot;School Night&amp;quot; inputs, and showing the final &amp;quot;Can Watch Movie&amp;quot; output. It would show exactly when you get to watch a movie and when you don&amp;#039;t!&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Bibliography ===&lt;br /&gt;
&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Truth Tables (General Explanation):&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
** &amp;quot;Truth Tables&amp;quot; from GeeksforGeeks. https://www.geeksforgeeks.org/logic-gates-and-truth-tables/&lt;br /&gt;
** &amp;quot;Logic Gates: Truth Tables, Boolean Algebra, and Digital Circuits&amp;quot; from study.com. https://study.com/academy/lesson/logic-gates-truth-tables-boolean-algebra-digital-circuits.html&lt;br /&gt;
** &amp;quot;Truth Tables&amp;quot; from SparkFun Learn. https://learn.sparkfun.com/tutorials/logic-gates/truth-tables&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Examples of Truth Tables for Specific Gates:&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
** &amp;quot;Logic Gates&amp;quot; from BBC Bitesize. https://www.bbc.co.uk/bitesize/guides/zx42wxs/revision/1&lt;br /&gt;
** &amp;quot;Boolean Algebra Basics - AND, OR, NOT, NAND, NOR, XOR Gates&amp;quot; from Tutorials Point. https://www.tutorialspoint.com/computer_fundamentals/computer_fundamentals_boolean_algebra.htm&lt;br /&gt;
&lt;br /&gt;
Gemini can make mistakes, so&lt;/div&gt;</summary>
		<author><name>Mr. Goldstein</name></author>
	</entry>
</feed>