Chapter 12

Using a Karnaugh map, simplify each boolean expression. $$x y^{\prime} z^{\prime}+x y^{\prime} z+x^{\prime} y^{\prime} z^{\prime}+x^{\prime} y^{\prime} z$$

Is \(\langle S, \cup, \cap,, \emptyset, U)\) a boolean algebra for each subset \(S\) of \(P(U),\) where \(U=[a, b, c] ?\) $$ \\{\emptyset,[a|,| b, c |, U\\} $$

Find the DNFs of the boolean functions $$\begin{array}{|ccc||c|} \hline \boldsymbol{x} & \boldsymbol{y} & \boldsymbol{z} & \boldsymbol{f}(\boldsymbol{x}, \boldsymbol{y}, \boldsymbol{z}) \\ \hline 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 0 & 0 & 1 \\ 1 & 0 & 1 & 0 \\ 1 & 1 & 0 & 0 \\ 1 & 1 & 1 & 1 \\ \hline \end{array}$$

Is \(\left\langle S, \cup, \cap,^{\prime}, \emptyset, U\right\rangle\) a boolean algebra for each subset \(S\) of \(P(U),\) where \(U=\\{a, b, c\\} ?\) $$\\{\emptyset,|a|,\\{b, c\\}, U\\}$$

Using a Karnaugh map, simplify each boolean expression. $$x y z+x y z^{\prime}+x^{\prime} y^{\prime} z^{\prime}+x^{\prime} y^{\prime} z$$

Is \(\langle S, \cup, \cap,, \emptyset, U)\) a boolean algebra for each subset \(S\) of \(P(U),\) where \(U=[a, b, c] ?\) $$ \\{\emptyset,|a|,|b|,\\{a, b |, U\\} $$

Find the DNFs of the boolean functions $$\begin{array}{|ccc||c|} \hline x & y & z & f(x, y, z) \\ \hline 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 1 & 1 & 1 \\ 1 & 0 & 0 & 1 \\ 1 & 0 & 1 & 0 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 0 \\ \hline \end{array}$$

Is \(\left\langle S, \cup, \cap,^{\prime}, \emptyset, U\right\rangle\) a boolean algebra for each subset \(S\) of \(P(U),\) where \(U=\\{a, b, c\\} ?\) $$\\{\emptyset, | a\\},\\{b\\},\\{a, b\\}, U\\}$$

Is \(\langle S, \cup, \cap,, \emptyset, U)\) a boolean algebra for each subset \(S\) of \(P(U),\) where \(U=[a, b, c] ?\) $$ \\{O,\\{b\\},[a, c], U\\} $$

Find the DNFs of the boolean functions $$\begin{array}{|ccc||c|} \hline x & y & z & f(x, y, z) \\ \hline 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 1 \\ 0 & 1 & 0 & 1 \\ 0 & 1 & 1 & 0 \\ 1 & 0 & 0 & 1 \\ 1 & 0 & 1 & 0 \\ 1 & 1 & 0 & 0 \\ 1 & 1 & 1 & 0 \\ \hline \end{array}$$

Is \(\left\langle S, \cup, \cap,^{\prime}, \emptyset, U\right\rangle\) a boolean algebra for each subset \(S\) of \(P(U),\) where \(U=\\{a, b, c\\} ?\) $$\\{\emptyset, | b\\}, | a, c\\}, U |$$

Is \(\langle S, \cup, \cap,, \emptyset, U)\) a boolean algebra for each subset \(S\) of \(P(U),\) where \(U=[a, b, c] ?\) $$ \\{\boldsymbol{O},\\{c],\\{a, b\\}, U\\} $$

Find the DNFs of the boolean functions $$\begin{array}{|ccc||c|} \hline x & y & z & f(x, y, z) \\ \hline 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 1 & 1 & 1 \\ 1 & 0 & 0 & 0 \\ 1 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 0 \\ \hline \end{array}$$

Is \(\left\langle S, \cup, \cap,^{\prime}, \emptyset, U\right\rangle\) a boolean algebra for each subset \(S\) of \(P(U),\) where \(U=\\{a, b, c\\} ?\) $$[\boldsymbol{\emptyset},|c|,|a, b|, U\\}$$

Design a half-adder with: NAND gates.

Find the DNF of each boolean function. $$ f(x, y)=x+x y^{\prime} $$

Design a half-adder with: NOR gates.

Find the DNFs of the boolean functions $$f(x, y)=x+x y^{\prime}$$

Find the DNF of each boolean function. $$ f(x, y)=(x+y) x y^{\prime} $$

Find the dual of each boolean property. $$x(x+y)=x$$

Find the boolean expression represented by each Karnaugh map.

Find the DNF of each boolean function. $$ f(x, y, z)=x+y z^{\prime} $$

Find the dual of each boolean property. $$(x+y) z=x z+y z$$

Find the DNFs of the boolean functions $$f(x, y, z)=x+y z^{\prime}$$

Find the boolean expression represented by each Karnaugh map.

Find the DNF of each boolean function. $$ f(x, y, z)=y(x+z) $$

Find the DNFs of the boolean functions $$f(x, y, z)=y(x+z)$$

Find the dual of each boolean property. $$(x y)^{\prime}=x^{\prime}+y^{\prime}$$

Find the DNFs of the boolean functions $$f(x, y, z)=(x+y) x y z$$

Represent each sum of minterms in a Karnaugh map. $$w x y^{\prime} z+w^{\prime} x y z$$

Represent each sum of minterms in a Karnaugh map. $$w x y z+w x y^{\prime} z+w^{\prime} x y z+w^{\prime} x y^{\prime} z$$

Prove algebraically. $$x 0=0$$

Represent each sum of minterms in a Karnaugh map. $$w x y^{\prime} z+w x^{\prime} y^{\prime} z+w^{\prime} x y^{\prime} z+w^{\prime} x^{\prime} y^{\prime} z$$

Represent each sum of minterms in a Karnaugh map. $$ w x^{\prime} y z^{\prime}+w x^{\prime} y^{\prime} z^{\prime}+w^{\prime} x^{\prime} y z^{\prime}+w^{\prime} x^{\prime} y^{\prime} z^{\prime} $$

Evaluate each boolean expression. $$1 \uparrow(0 \uparrow 1)$$

Evaluate each boolean expression. $$1 \downarrow(1 \downarrow 0)$$

Using a Karnaugh map, simplify each boolean expression. $$w x y z+w x^{\prime} y z+w^{\prime} x^{\prime} y z+w^{\prime} x y z$$

Evaluate each boolean expression. $$0 \uparrow(1 \downarrow 1)$$

Prove algebraically. $$(x+y) z=x z+y z$$

Using a Karnaugh map, simplify each boolean expression. $$ w x^{\prime} y z^{\prime}+w x^{\prime} y^{\prime} z^{\prime}+w^{\prime} x^{\prime} y z^{\prime}+w^{\prime} x^{\prime} y^{\prime} z^{\prime} $$

Evaluate each boolean expression. $$1 \downarrow(0 \uparrow 1)$$

Prove algebraically. $$x y^{\prime}+x^{\prime} y=(x+y)(x y)^{\prime}$$

Using a Karnaugh map, simplify each boolean expression. $$w x^{\prime} y z+w x^{\prime} y z^{\prime}+w x^{\prime} y^{\prime} z^{\prime}+w^{\prime} x^{\prime} y^{\prime} z^{\prime}+w^{\prime} x y^{\prime} z^{\prime}+w^{\prime} x y^{\prime} z$$

Evaluate each boolean expression. $$(0 \uparrow 1) \downarrow(0 \uparrow 1)$$

Using a Karnaugh map, simplify each boolean expression. $$w x y z+w x y z^{\prime}+w x y^{\prime} z^{\prime}+w x y^{\prime} z+w x^{\prime} y^{\prime} z+w^{\prime} x^{\prime} y^{\prime} z+w^{\prime} x y^{\prime} z$$

Evaluate each boolean expression. $$(1 \downarrow 0) \uparrow(1 \downarrow 1)$$

Construct a logic table for each boolean expression. $$(x \uparrow y) \uparrow(x \uparrow y)$$

Construct a logic table for each boolean expression. $$(x \downarrow y) \downarrow(x \downarrow y)$$

Construct a logic table for each boolean expression. $$(x \uparrow y) \downarrow(x \uparrow y)$$

Construct a logic table for each boolean expression. $$(x \downarrow y) \uparrow(x \downarrow y)$$