# Logic Function and Boolean Algebra Index

## Boolean Function Boolean Function: A Boolean function is an expression formed with binary variables, the two binary operators OR and AND, the unary operator NOT, parentheses and equal sign. Example: Boolean function F1: (abc’) The function F1 is equal to 1 if a= 1 AND b=1 AND c’ =1, otherwise F=0.   The Boolean function is represented as an algebraic expression. It may also be represented in truth table. Problem: Simplify the following Boolean function to minimum number of variables...

## Universal Gate The NAND and NOR gate are called to be universal gate because these are sufficient to implement any Boolean function.         (a) NAND and NOR can do function of NOT, AND and OR gate. A NOT operation is obtained from a one-input NAND gate. Thus we find that a single-input NAND gate behaves as inverter. The AND operation requires two NAND gates. The first one produces the inverted AND and the second one being a single input NAND gate, acts as an inverter to obtain the normal AND output. The OR operation, the normal input A...

## NAND, NOR, EX-OR and EX-NOR Gate The concept of NAND gate, NOR gate, Universal gate, Boolean functions, logic circuits or networks are explained briefly. These concepts are very important to grasp theme and theory of advance computer courses offered by several universities. NAND, NOR, EX-OR, EX-NOR gate:   (a) NAND Gate: The NAND gate has two or more inputs signals but only one output signals. All input signals must be high to get a low output. Truth table: A B (A.B)’ 0 0 1 0 1 1 1 0 1 1 1 0   If the output of an AND... 