• :00Days
  • :00Hours
  • :00Mins
  • 00Seconds
A new era for learning is coming soonSign up for free
Log In Start studying!

Select your language

Suggested languages for you:
Deutsch (DE)
Deutsch (UK)
Deutsch (US)

Americas

Europe

Answers without the blur. Sign up and see all textbooks for free! → Illustration

Q15E

Expert-verified
Discrete Mathematics and its Applications
Found in: Page 828
Discrete Mathematics and its Applications

Discrete Mathematics and its Applications

Book edition 7th
Author(s) Kenneth H. Rosen
Pages 808 pages
ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Register for Free I’ll do it later
Illustration

Short Answer

Use NAND gates to construct circuits with these outputs.

\(\begin{array}{l}{\bf{a)}}\overline {\bf{x}} \\{\bf{b)x + y}}\\{\bf{c)xy}}\\{\bf{d)x}} \oplus {\bf{y}}\end{array}\)

The circuits are

(a)

(b)

(c)

(d)

See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :
TABLE OF CONTENTS

Step 1: Defining of gates.

There are three types of gates.

It is also called NOT gate.

Step 2: Construct the circuit.

(a)

Step 3: Construct circuit by NAND.

(b)

Now,

\(\begin{array}{c}\overline {(\overline x + \overline y )} = \overline{\overline x} + \overline{\overline y} \\ = x - y\end{array}\)

Step 4: Construct circuit for xy.

(c)

Now, \(\overline{\overline {x.y}} = x.y\)

Step 5: Construct a circuit for \({\bf{x}} \oplus {\bf{y}}\).

(d)

Now,

\(\begin{array}{c}(\overline x + y).(x + \overline y ) = \overline {(\overline x + y)} .\overline {(x + \overline y )} \\ = \overline{\overline x} .\overline y + \overline x .\overline{\overline y} \\ = x.\overline y + \overline x .y\\ = x \oplus y\end{array}\)

Therefore, by the circuits get the results.

Most popular questions for Math Textbooks

use the laws in Definition \(1\) to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, the modular properties hold. That is, show that \({\bf{x}} \wedge {\bf{(y}} \vee {\bf{(x}} \wedge {\bf{z)) = (x}} \wedge {\bf{y)}} \vee {\bf{(x}} \wedge {\bf{z)}}\) and \({\bf{x}} \vee {\bf{(y}} \wedge {\bf{(x}} \vee {\bf{z)) = (x}} \vee {\bf{y)}} \wedge {\bf{(x}} \vee {\bf{z)}}\).

Exercises 14-23 deal with the Boolean algebra \(\left\{ {{\bf{0,1}}} \right\}\) with addition,multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example \(8\).

21. Verify De Morgan's laws.
  1. Show that \({\bf{(\bar 1}} \cdot {\bf{\bar 0) + (1}} \cdot {\bf{\bar 0) = 1}}\).
  2. Translate the equation in part (a) into a propositional equivalence by changing each \(0\) into an \({\bf{F}}\), each \(1\) into a \({\bf{T}}\), each Boolean sum into a disjunction, each Boolean product into a conjunction, each complementation into a negation, and the equals sign into a propositional equivalence sign.

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}}\).

Explain how to build a circuit for a light controlled by two switches using \({\bf{OR}}\) gates, \({\bf{AND}}\) gates, and inverters.
Icon

Want to see more solutions like these?

Sign up for free to discover our expert answers
Get Started - It’s free

Recommended explanations on Math Textbooks

Decision Maths

Read explanation

Calculus

Read explanation

Probability and Statistics

Read explanation

Statistics

Read explanation

Mechanics Maths

Read explanation

Geometry

Read explanation

Pure Maths

Read explanation

94% of StudySmarter users get better grades.

Sign up for free
94% of StudySmarter users get better grades.