Derive a boolean function f(x, y, z) that yields a 1 when exactly two of the three input variables are 0.

The notation from analyzing the Karnaugh map is:

F(X,Y,Z) = X'Y'Z + X'Z'Y + Y'Z'X

With logical functions would be:

F(X,Y,Z) = (NOT(X AND Y) AND Z) OR ((NOT Z) AND (X XOR Y))

Step-by-step explanation:

You can reduce the logical function with a Karnaugh map, like the attached, notice the gray coding notation, to assure only one variable change at each cell.

attachment?

step-by-step explanation:

b: |12 – x| ≤ 0.25

step-by-step explanation:      

let x be the possible lengths in inches, of the ribbons jaime cut.

we have been given that jaime is cutting strips of ribbon for a project. he tries to cut each piece to be 12 inches long, but sometimes he cuts it too long or too short by as much as 0.25 inch.  

we can represent this information in an inequality as:

by the definition of absolute value function we will get,

upon combining our inequalities we will get,

therefore, the inequality   describes all the possible lengths (x), in inches, of the ribbons jaime cut.

step-by-step explanation: