Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Show that

(a) \(\overline {\bf{x}} {\bf{ = x}} \downarrow {\bf{x}}\)

(b) \({\bf{xy = (x}} \downarrow {\bf{x)}} \downarrow {\bf{(y}} \downarrow {\bf{y)}}\)

(c) \({\bf{x + y = (x}} \downarrow {\bf{y)}} \downarrow {\bf{(x}} \downarrow {\bf{y)}}\)

Short Answer

Expert verified

By using the NOR operator get the results.

(a) \(\overline x = x \downarrow x\)

(b) \(xy = \left( {x \downarrow x} \right) \downarrow \left( {y \downarrow y} \right)\)

(c) \(x + y = \left( {x \downarrow y} \right) \downarrow \left( {x \downarrow y} \right)\)

Step by step solution

01

Definition

The complements of elements \(\overline 0 = 1\) and\(\overline 1 = 0\).

The Boolean sum + or OR is 1 if either term is 1.

The Boolean product (.) or AND is 1 if both terms are 1.

The NAND operator | is 1 if either term is 0.

The NOR operator\( \downarrow \)is 1 if both terms are 0.

02

Show the result of \(\overline {\bf{x}} {\bf{ = x}} \downarrow {\bf{x}}\).    (a)

Here \(\overline x = x \downarrow x\)

The NOR operator is 1 if either term is 0. Thus \(x \downarrow x\)is 1 if \(x\) is 0.

x

\(\overline x \)

\(x \downarrow x\)

0

1

1

1

0

0

The last two columns of the table are identical, which implies: \(\overline x = x \downarrow x\)

03

Evaluate the result of \({\bf{xy = (x}} \downarrow {\bf{x)}} \downarrow {\bf{(y}} \downarrow {\bf{y)}}\).(b)

Here \(xy = \left( {x \downarrow x} \right) \downarrow \left( {y \downarrow y} \right)\)

The NAND operator is 1 if either term is 0. Thus \(x \downarrow x\)is 1 if \(x\) is 0.

X

Y

\(x \downarrow x\)

\(\left( {y \downarrow y} \right)\)

\(xy\)

\(\left( {x \downarrow x} \right) \downarrow \left( {y \downarrow y} \right)\)

0

0

1

1

0

0

0

1

1

0

0

0

1

0

0

1

0

0

1

1

0

0

1

1

The last two columns of the table are identical, which implies: \(xy = \left( {x \downarrow x} \right) \downarrow \left( {y \downarrow y} \right)\)

04

Determine the result of \({\bf{x + y = (x}} \downarrow {\bf{y)}} \downarrow {\bf{(x}} \downarrow {\bf{y)}}\).(c)

Here \(x + y = \left( {x \downarrow y} \right) \downarrow \left( {x \downarrow y} \right)\)

The NAND operator is 1 if either term is 0. Thus \(x \downarrow y\)is 1 if \(x\) is 0.

X

Y

\(x \downarrow y\)

\(x + y\)

\(\left( {x \downarrow y} \right) \downarrow \left( {x \downarrow y} \right)\)

0

0

1

0

0

0

1

0

1

1

1

0

0

1

1

1

1

0

1

1

The last two columns of the table are identical, which implies: \(x + y = \left( {x \downarrow y} \right) \downarrow \left( {x \downarrow y} \right)\)

Therefore, by using the NOR operator get the results.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

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

Show that in a Boolean algebra, the complement of the element \(0\) is the element \(1\) and vice versa.

Construct circuits from inverters, AND gates, and ORgates to produce these outputs.

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

Which rows and which columns of a \(4{\bf{ \ast }}16\) map for Boolean functions in six variables using the Gray codes \({\bf{1111}},{\bf{1110}},{\bf{1010}},{\bf{1011}},{\bf{1001}},{\bf{1000}},{\bf{0000}},{\bf{0001}},{\bf{0011}},{\bf{0010}},{\bf{0110}},{\bf{0111}},{\bf{0101}},{\bf{0100}},{\bf{1100}},{\bf{1101}}\) to label the columns and \({\bf{11}},{\bf{10}},{\bf{00}},{\bf{01}}\) to label the rows need to be considered adjacent so that cells that represent min-terms that differ in exactly one literal are considered adjacent\(?\)

Find the depth of

a)The circuit constructed in Example 2 for majority voting among three people.

b)The circuit constructed in Example 3 for a light controlled by two switches.

c)The half adder shown in Figure 8.

d)The full adder shown in Figure 9.

Find a Boolean product of the Boolean variables x, y,and z, or their complements, that has the value 1 if and only if

a)x=y=0, z=1

b)x=0, y=1, z=0

c)x=0, y=z=1

d)x=y=z=0

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free