Boolean Algebra Truth Tables For A 2-input OR Gateįor a 2-input OR (Inclusive-OR) gate, the output Q is true if EITHER input A “ OR” input B is true, giving the Boolean Expression of: ( Q = A or B ).
Note that the Boolean Expression for a two input AND gate can be written as: A.B or just simply AB without the decimal point. Then the four possible combinations of A and B for a 2-input logic gate is given as: However, when dealing with Boolean expressions and especially logic gate truth tables, we do not general use “ON” or “OFF” but instead give them bit values which represent a logic level “1” or a logic level “0” respectively. There are “four” possible input combinations or 2 2 of “OFF” and “ON” for the two inputs. A logic gate truth table shows each possible input combination to the gate or circuit with the resultant output depending upon the combination of these input(s).įor example, consider a single 2-input logic circuit with input variables labelled as A and B.
The table used to represent the boolean expression of a logic gate function is commonly called a Truth Table. As well as a standard Boolean Expression, the input and output information of any Logic Gate or circuit can be plotted into standard Boolean Algebra truth tables to give a visual representation of the switching function of the system.
0 kommentar(er)
