  # The Systematic Reduction of Logic Circuits is Accomplished by

By BYJU'S Exam Prep

Updated on: September 25th, 2023 The Systematic Reduction of Logic Circuits is Accomplished by

1. Symbolic reduction
2. TTL logic
3. Using Boolean algebra
4. Using a truth table

Answer – C. Using Boolean algebra

## The systematic reduction of logic circuits is accomplished by using Boolean algebra.

Solution

For the reduction of the logic circuit, the logic expression is reduced to its minimal form. Reduction of expression is done using the laws of Boolean algebra, gray/cyclic/unit distance codes, and k-map.

Gray codes: binary codes with only a single bit difference between two sequential numbers. This is necessary for the reduction of any logical expression.

A few examples of reductions using the laws of Boolean algebra are –

A+Ā=1,  A.Ā=0,  AB + ĀB = B ( A+Ā= B

Therefore, The systematic reduction of logic circuits is accomplished by using Boolean algebra laws.

Hence, Option (C) is the correct answer.

### ☛ Related Questions:

POPULAR EXAMS
SSC and Bank
Other Exams GradeStack Learning Pvt. Ltd.Windsor IT Park, Tower - A, 2nd Floor, Sector 125, Noida, Uttar Pradesh 201303 help@byjusexamprep.com