Truth tables

From Computer Science Wiki
Revision as of 13:44, 22 October 2019 by Mr. MacKenty (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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.

Truth Tables[edit]

Please be aware in the video below they use specific symbols for logic symbols. The IB DOES NOT REQUIRE YOU TO USE SPECIFIC SYMBOLS. You can just draw a circle with the word AND or OR or NOT, etc...

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.

Do you have an advanced understanding about this topic?[edit]

See Also[edit]