need help to simplify boolean expression
demorganization is used to reduce the Boolean expressions
FALSE.... cuz in && operator the compiler chk both of the expression if any of the expression is false then answer will be false.. for true result both of d expression must be true... by warrior2pnk
a ⊕ b = ab' + a'b
If the inputs are ABC. The inputs required to give an output are ABC, AB, AC and BC. Using the Absorption law X + X.Y = X we can remove ABC, the inputs required are therefore AB, AC and BC.
An XNOR gate is a logic gate performing a Boolean logic XNOR operation, also known as an equivalence gate.
xor and xnor gates are derived from not gate
7404
XNOR gate is called coincidence gate
Out= A'B'C+AB'C'+AC'A'+ABC
Either XOR or XNOR can be used, but the output will be inverted on the XNOR.
For 2-input EX-OR gate, if one input is A, the other input is B, and the output is Y. Then the Boolean expression for EX-OR (XOR) function (gate) is Y=A⊕B The output Y is true if either input A or if input B is true, but not both.Y= ( (A and NOT B) or (NOT A and B) ) ;
In a boolean algebraic expression if the ^ is replaced by v and v replaced by ^ then that becomes dual of that boolean expression.
There are two forms of the NAND gate. Inverted input: Ouput = not Input1 and not Input2 and not Input3 ... Inverted output: Output = not (Input1 and Input2 and Input3 ...)
The gate is called EXNOR gate. its output is high when only one input is high. the Boolean expression for this gate for two inputs A and B is AB+A'B'
An AND gate is a logic gate performing a Boolean logic AND operation.
Construct circuit for Boolean expression (Mention out put at each step) (PÚ~ Q) Ù (P Ú Q)