# The answer to Boolean Algebra Expression

Computer Organization

Digital Logic Circuits(VI)

Boolean Algebra

Logic Microoperation

Sum of Products Form

Product of Sums Form

It is an explanation for solving the problems of Boolean Algebra in Computer Organization.

Using De Morgan's theorem, show that

(a) (A + B)'(A' + B')' = 0

(b) A + A'B + A'B' = 1

See the attached file.

© BrainMass Inc. brainmass.com October 24, 2018, 6:36 pm ad1c9bdddfhttps://brainmass.com/math/boolean-algebra/answer-boolean-algebra-expression-44220

#### Solution Preview

Computer Organization

Digital Logic Circuits(VI)

Boolean Algebra

...

#### Solution Summary

This solution is comprised of a detailed explanation for solving the problems of Boolean Algebra in Computer Organization.

It contains step-by-step explanation for the following problem:

Using De Morgan's theorem, show that

(a) (A + B)'(A' + B')' = 0

(b) A + A'B + A'B' = 1

Solution contains detailed step-by-step explanation.

Boolean Algebra and Digital Logic for simple digital circuits

For this module you will design some simple digital circuits based on Boolean expressions. Draw circuits that implement the following Boolean expressions using some combination of AND, OR, NOT, NAND, and NOR gates. (I recommend you draw your circuits on white paper with black pen, scan the images, and paste them into your Word document.)

- NOT X OR NOT Y OR Z

- X OR Y OR NOT Z

- NOT X AND Y OR NOT Y AND Z

Write a paper discussing your design. Please include the following:

1. Diagrams of your logic circuits.

2. Truth tables that indicate the output (a 0 or a 1) for each possible combination of values of X, Y, and Z.

3. A clear explanation of the relationship between Boolean Algebra and the circuits that you designed.

View Full Posting Details