A truth table is a tool making it possible to represent a phenomenon passive Logique. These tools are usually used in electronic (logical Porte) and in Informatique (tests).
A truth table is a table which represents entries (in column) and states binary (0/1, faux/vrai, éteint/allumé, etc). An exit, also represented in the form of column, is the resultant of the states of entry, itself expressed in the form of binary state.
How to read a truth table:
One seeks in the list of the entries the state desired to determine of it the exit (which is thus on the same line).
In the following example, to answer the question “which is the state of the exit when has and B is activated”, it is necessary to be placed on the last line.
Made up example: One reads AND:. and OR: + which is operators of a logical state. The entries " are noted; E" and the exits " S".
- Boolean algebra
- Table of Karnaugh
|Random links:||Châtelperron | Scol | Free Zeffirelli | Trepuzzi | Los Violas | Curaçao|