Consider a Boolean function $$f(w, x, y, z).$$ Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors $${i_1} = < {w_1},{x_1},{y_1},{z_1} > $$ and $${i_2} = < {w_2},{x_2},{y_2},{z_2} > ,$$ we would like the function to remain true as the input changes from $${i_1}$$ to $${i_2}$$ ($${i_1}$$ and $${i_2}$$ differ in exactly one bit position), without becoming false momentarily. Let $$f\left( {w,x,y,z} \right) = \sum {\left( {5,7,11,12,13,15} \right)} .$$ Which of the following cube covers of $$f$$ will entire that the required property is satisfied?

Which are the essential prime implicants of the following Boolean function? $$F\left( {a,b,c} \right) = {a^1}c + a{c^1} + {b^1}c$$

$$f\left( {A,B} \right) = A' + B$$ Simplified expression for function $$f((x+y,y),z)$$ is

Transform the following logic circuit (without expressing its switching function) into an equivalent logic circuit that employs only $$6$$ $$NAND$$ gates each with $$2$$-inputs.