Truth tables: Difference between revisions
Mr. MacKenty (talk | contribs) No edit summary |
Mr. MacKenty (talk | contribs) |
||
| Line 4: | Line 4: | ||
To determine the total number of possible permutations of <syntaxhighlight lang="python" inline>n</syntaxhighlight> given inputs you'll need 2^n input combinations to test. | To determine the total number of possible permutations of <syntaxhighlight lang="python" inline>n</syntaxhighlight> given inputs you'll need 2^n input combinations to test. | ||
== Do you understand this topic? == | == Do you understand this topic? == | ||
Latest revision as of 09:45, 15 October 2024
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]
To determine the total number of possible permutations of n given inputs you'll need 2^n input combinations to test.
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.