Chapter 12: Q8RE (page 844)
Construct a half adder using \(OR\) gates, \(AND\) gates, and inverters.
Short Answer
The sum is \({\bf{(x + y)(}}\overline {{\bf{xy}}} {\bf{)}}\) and carry\({\bf{xy}}\).
Chapter 12: Q8RE (page 844)
Construct a half adder using \(OR\) gates, \(AND\) gates, and inverters.
The sum is \({\bf{(x + y)(}}\overline {{\bf{xy}}} {\bf{)}}\) and carry\({\bf{xy}}\).
All the tools & learning materials you need for study success - in one app.
Get started for freeUse the Quine–McCluskey method to simplify the sum-of-products expansions in Exercise \(14\).
Draw the \({\bf{3}}\)-cube \({{\bf{Q}}_{\bf{3}}}\) and label each vertex with the minterm in the Boolean variables \({\bf{x, y}}\), and \({\bf{z}}\) associated with the bit string represented by this vertex. For each literal in these variables indicate the \({\bf{2}}\)-cube \({{\bf{Q}}_{\bf{2}}}\) that is a subgraph of \({{\bf{Q}}_{\bf{3}}}\) and represents this literal.
Use a \(K{\bf{ - }}\)map to find a minimal expansion as a Boolean sum of Boolean products of each of these functions of the Boolean variables \({\bf{x}}\) and \({\bf{y}}\).
\(\begin{array}{l}{\bf{a)\bar xy + \bar x\bar y}}\\{\bf{b)xy + x\bar y}}\\{\bf{c)xy + x\bar y + \bar xy + \bar x\bar y}}\end{array}\)
Use a \({\bf{3 - }}\)cube \({{\bf{Q}}_{\bf{3}}}\) to represent each of the Boolean functions in Exercise \(5\) by displaying a black circle at each vertex that corresponds to a \({\bf{3 - }}\)tuple where this function has the value \({\bf{1}}\).
Show that if \({\bf{F, G}}\), and \({\bf{H}}\) are Boolean functions of degree \({\bf{n}}\), then \({\bf{F + G}} \le {\bf{H}}\) if and only if \({\bf{F}} \le {\bf{H}}\) and \({\bf{G}} \le {\bf{H}}\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.