Truth tables: Difference between revisions
Mr. MacKenty (talk | contribs) |
Mr. MacKenty (talk | contribs) |
||
| Line 16: | Line 16: | ||
</html> | </html> | ||
== Do you understand this topic? == | == Do you understand this topic? == | ||
* Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR. | |||
* Construct truth tables using the above operators. | |||
* Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates. | |||
== Do you have an advanced understanding about this topic? == | == Do you have an advanced understanding about this topic? == | ||
Revision as of 08:38, 2 September 2016
This is an important concept. You should fully understand this.
This is a basic concept in computer science
A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—to compute the functional values of logical expressions on each of their functional arguments, that is, on each combination of values taken by their logical variables (Enderton, 2001). In particular, truth tables can be used to tell whether a propositional expression is true for all legitimate input values, that is, logically valid.[1]
Truth Tables[edit]
Do you understand this topic?[edit]
- Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR.
- Construct truth tables using the above operators.
- Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates.