Question

In: Computer Science

given y = A'B+ A'BC' + A'BCD + A'BC'D'E - create a logic schematic - simplify...

given y = A'B+ A'BC' + A'BCD + A'BC'D'E

- create a logic schematic

- simplify the boolean expression

- create a new logic schematic of the simplified version

Solutions

Expert Solution

Given y = A'B+ A'BC' + A'BCD + A'BC'D'E

logic schematic:

Explanation:
Negation(¬) of any logical Identity P is Nothing but Opposite Truth Value for P. i.e If P is T then (¬P) is F
And gate is used to find the Product of Two literals P AND Gate Q Output is PQ
OR gate is used to find the Sum of Two literals P OR Gate Q Output is P+Q

simplify the boolean expression:

Given y = A'B+ A'BC' + A'BCD + A'BC'D'E

y = A'B+ A'B(C' + CD) + A'BC'D'E { By Distributive law PQ+PR = P(Q+R) }

y = A'B+ A'B(C' + C)(C' + D) + A'BC'D'E   { By Distributive law P+QR = (P+Q)(P+R) }

y = A'B+ A'B(1)(C' + D) + A'BC'D'E  { We know that P+P'= 1 }

y = A'B+ (A'BC' + A'BD) + A'BC'D'E  { By Distributive law P(Q+R) = PQ+PR }

y = A'B(1+ C') + A'B(D +C'D'E) { By Distributive law PQ+PR = P(Q+R) }

y = A'B(1) + A'B(D +C')(D +D')(D +E)  { By Distributive law P+QR = (P+Q)(P+R) }

y = A'B(1) + A'B(D +C')(1)(D +E) { We know that P+P'= 1 }

y = A'B(1) + A'B(D +C'E)  { By Distributive law (P+Q)(P+R) = P+QR }

y = A'B+ (A'BD +A'BC'E) { By Distributive law P(Q+R) = PQ+PR }

y = A'B(1+D) +A'BC'E { By Distributive law PQ+PR = P(Q+R) }

y = A'B(1) +A'BC'E  { We know that P+1= 1 }

y = A'B(1 + C'E)   { By Distributive law PQ+PR = P(Q+R) }

y = A'B(1 + C')(1 + E) { By Distributive law P+QR = (P+Q)(P+R) }

y = A'B(1)(1) { We know that P+1= 1 }

y = A'B

Which is Required Simplified Expression

New logic schematic of the simplified version

Explanation:
Negation(¬) of any logical Identity P is Nothing but Opposite Truth Value for P. i.e If P is T then (¬P) is F
And gate is used to find the Product of Two literals P AND Gate Q Output is PQ


Related Solutions

Use euler method to approiximate y(1) y' is given , solve for y. approiximate y(1) Create...
Use euler method to approiximate y(1) y' is given , solve for y. approiximate y(1) Create a table to show the approximate value of y(1) for each choice of h. y’ = -15y y(0) = 1 h = .25 h = .125 h = .0625 h = .03125
Create a decision table that describes the ORDER process. Simplify the table you create and describe the results.
Task 1: Fresh-Mart GroceryFresh-Mart Grocery is a regional grocery chain that is developing an information system to monitor product sales and inventory levels. As products are sold in stores, they need to be replaced by shipments from the distribution centers. The IT manager wants you to document the automatic ordering process called “ORDER” which determines whether to order or not. The process works as follows:Whenever a sale transaction takes place, the system checks if product inventory is left at the...
Create a schematic of a circuit using and write C program to run on a PIC...
Create a schematic of a circuit using and write C program to run on a PIC 16F88 that will flash between a red and green LED at 5Hz with the green on 75% of the time and the red on 25% of the time.
Create a schematic to show the step by step progression of joint faulting distress in a...
Create a schematic to show the step by step progression of joint faulting distress in a JPCP section of rigid pavement.
The following logic function is given as a sum of minterms F(W,X,Y,Z) = ∑W,X,Y,Z(7,8,10,11,13) + D(5,...
The following logic function is given as a sum of minterms F(W,X,Y,Z) = ∑W,X,Y,Z(7,8,10,11,13) + D(5, 9, 15). (25 points) a) Draw the K-Map and find the minimal sum-of-products expression for this function. b) Draw the circuit implementing this expression c) Give all input pair or pairs where transition between them would create a timing hazard d) Draw the timing diagram showing the glitch corresponding to the pair or one of the pairs. Assume ALL gate delays are equal e)...
Show all of your work. No credit will be given if there is no work. Simplify...
Show all of your work. No credit will be given if there is no work. Simplify if possible, unless noted. Setup: • Suppose the probability of a part being manufactured by Machine A is 0.4 • Suppose the probability that a part was manufactured by Machine A and the part is defective is 0.12 • Suppose the probability that a part was NOT manufactured by Machine A and the part IS defective is 0.14 Questions To Answer: 1. (2 pts)...
Create a schematic diagram showing the mechanisms and consequences of the conditions that can cause ARF...
Create a schematic diagram showing the mechanisms and consequences of the conditions that can cause ARF if left untreated (see rubrics for scoring). • Alveolar hypoventilation • Diffusion abnormalities • Ventilation-perfusion mismatching • Shunting
Create the logic for an application that instantiates an object of the ATM class. Prompt the...
Create the logic for an application that instantiates an object of the ATM class. Prompt the user for the ATM object data to display the user’s bank balance PROGRAMMING LOGIC AND DESIGN QUESTION JAVA LANGUAGE
In each case, compute the derivative dy dx . Do not simplify your answer. a) y=...
In each case, compute the derivative dy dx . Do not simplify your answer. a) y= 4x^3e^5x b) y=ln {(x^3 + 3x)(2x^4 -1)} using product rule c) f (x) = x^4 ln 3x - 2/ e^2x d) y= ln(2x^3)/ (4x^2-1) Please show all work and label answers according to question number / letter
X(Y'+Z)+[X(Y'+X)]'=1 State which of the following theorems is used to simplify A) Idempotent B) Law of...
X(Y'+Z)+[X(Y'+X)]'=1 State which of the following theorems is used to simplify A) Idempotent B) Law of Complementary C) Operations involving 1&0 D) Involution
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT