Question

solve the logical expression (a'b XOR ab) + a'b'c reduce to IDNF expression

solve the logical expression
(a'b XOR ab) + a'b'c

reduce to IDNF expression

Homework Answers

Answer #1

IDNF(Irredundant Disjunctive Normal Form)

If a logical expression consists of disjunction (OR operation) of one or more conjunction(AND) then the expression is said to be in Disjunctive Normal Form. In simple words, it is Sum of Products(SOP). that is one or more product terms are added together to get this form(it may include complemented or original form of a variable). For example, if A and B are two variables, AB , A'B, AB',A'B' are said to be the conjunctions and AB+A'B is a Disjunctive normal form

In the given question:

(a'b XOR ab) + a'b'c

= [(a'b)'ab+a'b(ab)' ]+a'b'c ( because, a XOR b = a'b +ab')

=(a''+b')ab+a'b(a'+b')+a'b'c (By Demorgan's law, (ab)' = a' + b')

=(a+b')ab+a'b(a'+b')+a'b'c (By involution law, (a')'=a )

=aab+abb'+a'ba'+a'bb'+a'b'c (Distributive law)

=ab+a'b+a'b'c ( By complement law,a . a' = 0, and By Idempotent law  a . a =a)

=ab+a'(b+b'c)

=ab+ '( (b+b') .(b+c))   (Distributive law)

=ab+a'(1.(b+c))   ( By complement law, b+b'=1)

=ab+a'b+a'c (Distributive law)

=(a+a')b+a'c  ( By complement law, a+a'=1)

=b+a'c

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Suppose △ABC and △A'B'C' are triangles such that line AB || to line A'B', line BC...
Suppose △ABC and △A'B'C' are triangles such that line AB || to line A'B', line BC || to line B'C', and line AC || to line A'C'. Prove that △ABC ~ △A'B'C'.
using algebraic manipulation solve: A(A'+B)(A'B'+C)(A'B'C'+D)=ABCD
using algebraic manipulation solve: A(A'+B)(A'B'+C)(A'B'C'+D)=ABCD
Simplify the boolean equation: C(A'B' + AB'(C + BD)) then draw the logic schematic
Simplify the boolean equation: C(A'B' + AB'(C + BD)) then draw the logic schematic
Reduce using Axioms and theorems of Boolean algebra. Show step-by-step: (A'B'C)+(A'BC')+(A'BC)+(AB'C)+(ABC)
Reduce using Axioms and theorems of Boolean algebra. Show step-by-step: (A'B'C)+(A'BC')+(A'BC)+(AB'C)+(ABC)
how do I convert this SOP expression using only 2-input NAND gates? (use DeMorgan's Law) R...
how do I convert this SOP expression using only 2-input NAND gates? (use DeMorgan's Law) R = A'B'C' + AB'
Support Vector Machines ( SVM) . The Mercer kernel used to solve the XOR problem is...
Support Vector Machines ( SVM) . The Mercer kernel used to solve the XOR problem is given by k(xi, xj) = (1 + xi Txj) p . What is the smallest positive integer p for which the XOR problem is solved? Show the kernel and XOR Problem solution using SVM.
Build a truth table for the expression: a. AB’ + A’B + AB + A’B’ b....
Build a truth table for the expression: a. AB’ + A’B + AB + A’B’ b. A’B’C’ + ABC + C’B’A Create a truth table if needed. Create a Karnaugh map and simplify the expressions. b. AB’C’ + B’C c. ABC’D + A’CD + AC’D
The language described by the regular expression ((ab)* (c|d))*
The language described by the regular expression ((ab)* (c|d))*
Draw the parse tree for regular expression bb*+ab*(a+b).
Draw the parse tree for regular expression bb*+ab*(a+b).
What would be the mathematical / logical expression to figure out whether a cylinder fits inside...
What would be the mathematical / logical expression to figure out whether a cylinder fits inside another cylinder?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT