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

Draw the \({\bf{K}}\)-maps of these sum-of-products expansions in three variables.

\(\begin{array}{l}{\bf{a) x\bar y\bar z}}\\{\bf{b) \bar xyz + \bar x\bar y\bar z}}\\{\bf{c) xyz + xy\bar z + \bar xy\bar z + \bar x\bar yz}}\end{array}\)

Short Answer

Expert verified

\(\left( {\bf{a}} \right)\)The K-map of the sum-of-products is

\(\left( {\bf{b}} \right)\) The K-map of the sum-of-products is

\(\left( {\bf{c}} \right)\) The K-map of the sum-of-products is

Step by step solution

01

Definition

To reduce the number of terms in a Boolean expression representing a circuit, it is necessary to find terms to combine. There is a graphical method, called a Karnaugh map or K-map, for finding terms to combine for Boolean functions involving a relatively small number of variables. It will first illustrate how K-maps are used to simplify expansions of Boolean functions in two variables. It will continue by showing how K-maps can be used to minimize Boolean functions in three variables and then in four variables. Then it will describe the concepts that can be used to extend K-maps to minimize Boolean functions in more than four variables.

A \({\bf{K}}\)-map for a function in three variables is a table with four columns \({\bf{yz, y\bar z,\bar y\bar z}}\) and \({\bf{\bar yz}}\); which contains all possible combinations of \({\bf{y}}\) and \({\bf{z}}\) and two rows \({\bf{x}}\) and \({\bf{\bar x}}\).

02

Placing the value in the cell

(a)

Place a \(1\) in the cell corresponding to each term in the given sum \({\bf{x}}\overline {{\bf{yz}}} \).

\({\bf{x}}\overline {{\bf{yz}}} \) : place a \(1\) in the cell corresponding to row \({\bf{x}}\) and column \(\overline {{\bf{yz}}} \).

03

Placing the value in the cell

(b)

A \({\bf{K}}\)-map for a function in three variables is a table with four columns \({\bf{yz}}\), \({\bf{y\bar z,\bar y\bar z}}\) and \({\bf{\bar yz}}\); which contains all possible combinations of \({\bf{y}}\) and \({\bf{z}}\) and two rows \({\bf{x}}\) and \({\bf{\bar x}}\).

It places a \(1\) in the cell corresponding to each term in the given sum \({\bf{\bar xyz + \bar x\bar y\bar z}}\).

\({\bf{\bar xyz}}\): place a \(1\) in the cell corresponding to row \({\bf{\bar x}}\) and column \({\bf{yz}}\).

\({\bf{\bar x\bar y\bar z}}\) : place a \(1\) in the cell corresponding to row \({\bf{\bar x}}\) and column \({\bf{\bar y\bar z}}\).

04

Placing the value in the cell

(c)

A \({\bf{K}}\)-map for a function in three variables is a table with four columns \({\bf{yz, y\bar z,\bar y\bar z}}\) and \({\bf{\bar yz}}\); which contains all possible combinations of \({\bf{y}}\) and \({\bf{z}}\) and two rows \({\bf{x}}\) and \({\bf{\bar x}}\).

Place a \(1\) in the cell corresponding to each term in the given sum \({\bf{xyz + xy\bar z + \bar xy\bar z + \bar x\bar yz}}\).

\({\bf{xyz}}\): place a \(1\) in the cell corresponding to row \({\bf{x}}\) and column \({\bf{yz}}\).

\({\bf{xy\bar z}}\): place a \(1\) in the cell corresponding to row \({\bf{x}}\) and column \({\bf{y\bar z}}\).

\({\bf{\bar xy\bar z}}\): place a \(1\) in the cell corresponding to row \({\bf{\bar x}}\) and column \({\bf{y\bar z}}\).

\({\bf{\bar x\bar yz}}\) : place a \(1\) in the cell corresponding to row \({\bf{\bar x}}\) and column \({\bf{\bar yz}}\).

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

Find a Boolean product of Boolean sums of literals that has the value 0 if and only if \({\bf{x = y = 1}}\) and \({\bf{z = 0,x = z = 0}}\) and \({\bf{y = 1}}\), or \({\bf{x = y = z = 0}}\). (Hint: Take the

Boolean product of the Boolean sums found in parts (a), (b), and (c) in Exercise 7.)

How many cells in a \({\bf{K}}\)-map for Boolean functions with six variables are needed to represent \({{\bf{x}}_{\bf{1}}}{\bf{,}}{{\bf{\bar x}}_{\bf{1}}}{{\bf{x}}_{\bf{6}}}{\bf{, }}{{\bf{\bar x}}_{\bf{1}}}{{\bf{x}}_{\bf{2}}}{{\bf{\bar x}}_{\bf{6}}}{\bf{,}}{{\bf{x}}_{\bf{2}}}{{\bf{x}}_{\bf{3}}}{{\bf{x}}_{\bf{4}}}{{\bf{x}}_{\bf{5}}}\), and \({{\bf{x}}_{\bf{1}}}{{\bf{\bar x}}_{\bf{2}}}{{\bf{x}}_{\bf{4}}}{{\bf{\bar x}}_{\bf{5}}}\), respectively\({\bf{?}}\)

Deal with the Boolean algebra \(\{ 0,1\} \) with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example \(8\).

Verify the zero property.

The Boolean operator \( \oplus \), called the \(XOR\) operator, is defined by \(1 \oplus 1{\bf{ = }}0,1 \oplus 0{\bf{ = }}1,0 \oplus 1{\bf{ = }}1\), and \(0 \oplus 0{\bf{ = }}0\).

\(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\(?\)

Show that you obtain De Morgan's laws for propositions (in Table \(6\) in Section \(1.3\)) when you transform De Morgan's laws for Boolean algebra in Table \(6\) into logical equivalences.

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