Chapter 12: Q17E (page 828)
Construct a half adder using NAND gates.
Short Answer
The circuit is
Chapter 12: Q17E (page 828)
Construct a half adder using NAND gates.
The circuit is
All the tools & learning materials you need for study success - in one app.
Get started for freeIs there a single type of logic gate that can be used to build all circuits that can be built using \({\bf{OR}}\)gates, \({\bf{AND}}\) gates, and inverters?
Use a \(3\)- cube \({{\bf{Q}}_{\bf{3}}}\) to represent each of the Boolean functions in Exercise \(6\) by displaying a black circle at each vertex that corresponds to a \(3\)-tuple where this function has the value \(1\) .
Are these sets of operators functionally complete?
a) \(\left\{ {{\bf{ + ,}} \oplus } \right\}\)
b) \(\left\{ {\,{\bf{,}} \oplus } \right\}\)
c) \({\bf{\{ \cdot,}} \oplus {\bf{\} }}\)
Use a table to express the values of each of these Boolean functions.
\(\begin{array}{l}(a)F(x,y,z) = \bar xy\\(b)F(x,y,z) = x + yz\\(c)F(x,y,z) = x\bar y + \overline {(xyz)} \\(d)F(x,y,z) = x(yz + \bar y\bar z)\end{array}\)
\(a)\) What does it mean for a set of operators to be functionally complete\(?\)
\(b)\)Is the set \(\{ {\bf{ + }}, \cdot \} \) functionally complete\(?\)
\(c)\)Are there sets of a single operator that are functionally complete\(?\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.