Digital Electronics - Boolean Algebra and Logic Simplification - Discussion
Discussion Forum : Boolean Algebra and Logic Simplification - General Questions (Q.No. 9)
9.
The systematic reduction of logic circuits is accomplished by:
Discussion:
4 comments Page 1 of 1.
Gereajohn said:
7 years ago
Please explain this by symbolically.
Ram suraj said:
8 years ago
NO. It cannot be reduced by truth table. Probably, Truth table is just to know the given expressions HIGH or LOW and only with the help of truthtable we can draw a logic circuit diagram.
Kajal said:
9 years ago
Can't it can be reduced by truth table?
Narendra said:
1 decade ago
The systematic reduction of logic circuit is accomplished by two ways,
1. BOOLEAN ALGEBRA METHOD
2. KARNAUGH MAP(K-MAP) METHOD.
1. BOOLEAN ALGEBRA METHOD
2. KARNAUGH MAP(K-MAP) METHOD.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers