The Boolean function F(x, y, z) = xy’z + (x + z’ + xz’)’ simplifies to:

  • x’z + y’z

The Boolean function F(x, y) = x’y’ + x’y + xy’ is equivalent to:

  • (xy)'

The Boolean function F(x, y) = x’y + xy’ + (x’+y’)(xy) can be simplified to:

  • x ⊕ y.

The truth table shown below is supposed to reflect the function F(x, y, z) = (x’y’ + yz) + (xy’ + yz’) but two lines are in error. Identify them.

  • 1 and 2

The Boolean function F(x, y, z) = (y + x)(y + x’)(y’+ z) is equivalent to:

  • yz

Suppose the state machine shown below is in State C and receives the string 100010. What is its ending state?

  • B

The Boolean expressions x(x + y) = x and x + xy = x are examples of (the):

  • Absorption Law.

The complement, F’, of F(x, y, z) = x(y’z + y) + x’(y + z’)’ (not simplified) is:

  • (x’ + (y + z’)(y’))(x + (y + z’)).

uppose the state machine shown below is in State B. In order for this machine to output the string 010 001 010 011 001 010 when given the input string 101101, what should the output value be as indicated by “?/???”?

  • 1/010

The state machine shown below is an example of a(n):

  • Mealy machine.

The Boolean expressions, x + (yz) = (x + y)(x + z) and x(y + z) = xy + xz, are examples of (the):

  • Distributive Law

The Boolean expressions, xx = x and x + x = x, are examples of (the):

  • Idempotent Law

The Boolean function F(x, y) = x’y’ + x’y + xy is equivalent to:

  • (xy’)'.

The Boolean function F(x, y) = x’y’ + xy’ + y(xy’) can be simplified to:

  • y'

The Boolean function F(x, y, z) = y’z + x’yz + xyz is equivalent to:

  • z

Suppose the state machine shown below is in State A and receives the string 10010100. What is its output?

  • 00 10 11 10 00 01 11 10 11

The Boolean AND operation is also known as:

  • Boolean product

The Boolean function F(x, y, z) = xy’z + (x + z’ + xz’)’ simplifies to:

  • x’z + y’z