Question

In: Computer Science

Digital Logic Design Lab Prove the following Boolean Algebra theorems and properties by constructing Logic Circuits...

Digital Logic Design Lab

Prove the following Boolean Algebra theorems and properties by constructing Logic Circuits for each theorem/properties using our educational simulation software:

Q1-a) The Distributive Property:     a + ( b . c ) = ( a + b ) . ( a + c )

Q1-b) The Distributive Property:     a . ( b + c ) = ( a . b ) + ( a . c )

Solutions

Expert Solution

Distributive law :

a + (b.c) = (a + b)(a + c)

This is called OR distributes over AND.

Proof:

a + b.c = a * 1 + b.c → since a*1 = a

= a.(1 + b)+ b.c → since 1 + B = 1

= a * 1 + a.b + b.c

= a *(1 + c) + a.b + b.c → since a*a = a*1 = a

= a*(a + c) + b.(a + c)

= (a + c) (a + b)

a + b.c = (a + b) (a + c)

Hence proved.

2)

a.(b+c) = (a.b) + (a.c)

This is called AND distributes over OR.

Proof:
a.(b + c) = a.(b*1) + a.(c*1) → since 1 * b = b, 1 * c = c

= [(a.b)*(a*1)] + [(a.c) *(a*1)]

=[(a.b) * a] + [(a.c) *a]

= (a +1) (a.b + a.c)

= (a.b +a.c) → since 1 + a = 1

Hence proved.


Related Solutions

Using the principles and components of digital and linear logic circuits design a circuit that is...
Using the principles and components of digital and linear logic circuits design a circuit that is able to open and close the door of a garage of vehicles according to the following conditions: a) The door will open in the following cases: a.1) a manual push-button is activated and there is sunlight. a.2) the button is not activated, there is no sunlight and the light of a vehicle is detected. b) The door must close after 30 seconds of opening....
In digital logic circuits, what are the maximum number of inputs for the following gates: AND...
In digital logic circuits, what are the maximum number of inputs for the following gates: AND OR NOR XOR(is it 2?) XNOR (is it 2?) NAND
Assume B is a Boolean Algebra. Prove the following statement using only the axioms for a...
Assume B is a Boolean Algebra. Prove the following statement using only the axioms for a Boolean Algebra properties of a Boolean Algebra. Uniqueness of 0: There is only one element of B that is an identity for + please include all the steps.
use modelsim write Verilog code for the following digital logic circuits and then simulate them by...
use modelsim write Verilog code for the following digital logic circuits and then simulate them by writing a testbench module for each of them , (a)The FSMs for the snail problem that is in the slides (a snail crawls over a tape that has 0 and 1 and smiles if it has detected the '10' bits using both Moore and Mealy FSM. Note that the pattern is '10' not '01' as in the slides. (b) A rock-paper-scissor game played by...
Simplify the equation using Boolean algebra properties. F = xy + xy’z + x’yz
Simplify the equation using Boolean algebra properties. F = xy + xy’z + x’yz
Use boolean algebra to prove that: (A^- *B*C^-) + (A^- *B*C) + (A* B^- *C) +...
Use boolean algebra to prove that: (A^- *B*C^-) + (A^- *B*C) + (A* B^- *C) + (A*B* C^-) + (A*B*C)= (A+B)*(B+C) A^- is same as "not A" please show steps to getting the left side to equal the right side, use boolean algebra properties such as distributive, absorption,etc
3. Simplify the following expressions using the properties of boolean algebra : 3A)    S(A,B,C) = A'B'C...
3. Simplify the following expressions using the properties of boolean algebra : 3A)    S(A,B,C) = A'B'C + A'BC + AB'C + ABC 3B) F(A,B,C) = A'B'C' + A'B'C + AB'C' + AB'C + ABC' + ABC
1. Use Boolean algebra to simplify the following Boolean expressions to expressions containing a minimum number...
1. Use Boolean algebra to simplify the following Boolean expressions to expressions containing a minimum number of literals: (a) A’C’ + A’BC + B’C (b) (A + B + C)’(ABC)’ (c) ABC’ + AC (d) A’B’D + A’C’D + BD (e) (A’ + B)’(A’ + C’)’(AB’C)’ (f) (AE + A’B’)(C’D’ + CD) + (AC)’ 2. Obtain the truth table of the function F = (AB + C)(B + AC), express the function F in sum-of-minterms and product-of-maxterms forms, and express...
(TCO 2) Which of the following operations is not an operation of Boolean algebra? $ |...
(TCO 2) Which of the following operations is not an operation of Boolean algebra? $ | & ~
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean...
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean algebra (show your work and write the property you are applying). State if they cannot be simplified A. X’Y + XY B. (X + Y)(X + Y’) C. (A’ + B’) (A + B)’ D. ABC + A’B + A’BC’ E. XY + X(WZ + WZ’)
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT