Question

In: Computer Science

4. Using the switching algebra theorems minimize the following logic functions: a. F = WXYZ(WXYZ’ +...

4. Using the switching algebra theorems minimize the following logic functions:

a. F = WXYZ(WXYZ’ + WX’YZ + W’XYZ + WXY’Z)
b. F = XY + X’Y + YZ +Y’Z

c. F = A’C’ + A’BC + B’C
d. F = X + Y (Z + X + Z)

Solutions

Expert Solution

a). F = WXYZ ( WXYZ’ + WX’YZ + W’XYZ + WXY’Z )

=  WXYZ WXYZ’ +WXYZ WX’YZ + WXYZ W’XYZ + WXYZ WXY’Z )

= WXYZZ' + WXX'Z + XYZWW'+WXZYY'

= WXY (ZZ' )+ WZ (XX') + XYZ (WW'+)WXZ (YY' )

  = 0 + 0 + 0 +0

= 0

.............................................................................................................................
b). F = XY + X’Y + YZ +Y’Z

= XY +X'Y + Z( Y+Y' )

= XY + X'Y + Z(1)

= XY + X'Y + Z

= Y(X+X') + Z

= Y(1) +Z [ Since A+ A'=1 ]

= Y + Z

..........................................................................................................................................

c). F = A’C’ + A’BC + B’C

= A’C’ + A’BC + B’C(A+A')

= A'C' + A'BC + B'CA + B'CA'

  ..............................................................................................................................................

d). F = X + Y (Z + X + Z)

= X + YZ+ YX+YZ

= X + YZ +YX [ Since A + A = A ]

= X(1+Y) + YZ

= X(1) + YZ

= X + YZ


Related Solutions

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 )
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: Q2-a) Prove that:            aa’ = 0 Q2-b) Prove that:           a+a’=1
Problem ( Proving theorems!) For each of the following statements, translate it into predicate logic and...
Problem ( Proving theorems!) For each of the following statements, translate it into predicate logic and prove it, if the statement is true, or disprove it, otherwise: 1. for any positive integer, there exists a second positive the square of which is equal to the first integer, 2. for any positive integer, there exists a second positive integer which is greater or equal to the square of the the first integer, 3. for any positive integer, there exists a second...
2)Prove, using Boolean Algebra theorems, that the complement of XOR gate is XNOR gate (Hint :...
2)Prove, using Boolean Algebra theorems, that the complement of XOR gate is XNOR gate (Hint : Prove that AB + AB = AB + AB by using De-Morgan’s theorem)
2)Prove, using Boolean Algebra theorems, that the complement of XOR gate is XNOR gate(Hint : Prove...
2)Prove, using Boolean Algebra theorems, that the complement of XOR gate is XNOR gate(Hint : Prove that AB + AB = AB + ABby using De-Morgan’s theorem)3)Draw the K-Map for the following Boolean function. Obtain the simplified Sum of Products (SOP) expression, using the K-Map minimization procedure .?(????)=∑?(1,2,3,5,7,9,11,13)
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
Implement the following logic function as embedded logic inside a positive TSPC register. F= ab +...
Implement the following logic function as embedded logic inside a positive TSPC register. F= ab + bcd + ad
1) Implement the given logic function using a 4:1 MUX. F(A,B,C) = Σm(0,1,3,7) Show the truth...
1) Implement the given logic function using a 4:1 MUX. F(A,B,C) = Σm(0,1,3,7) Show the truth table, the 4:1 MUX schematic with the inputs, select inputs and the output. 2) 2) For an 8:3 priority encoder: a) Draw the schematic. b) Write the truth table. c) Write the Boolean expressions for each of the outputs in terms of the inputs. d) Draw the logic circuit for the outputs in terms of the inputs.
Let A = {1, 2, 3, 4, 5}. Find the inverse of the following functions f:...
Let A = {1, 2, 3, 4, 5}. Find the inverse of the following functions f: A→ A. ? = {(1,1),(2,3),(3,2),(4,4),(5,5)     ? = {(1,5),(2,4),(3,2),(4,1),(5, 4)} ? = {(2,1),(3,4),(1,3),(4,1),(5, 2)}
Do it in python please Write a program using functions and mainline logic which prompts the...
Do it in python please Write a program using functions and mainline logic which prompts the user to enter a number, then generates that number of random integers and stores them in a list. It should then display the following data to back to the user: The list of integers The lowest number in the list The highest number in the list The total sum of all the numbers in the list The average number in the list At a...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT