Chapter 12: Q1RE (page 844)
Define a Boolean function of degree \({\bf{n}}\).
Short Answer
A function \({\bf{f}}\) in \({\bf{n}}\) variables taking two values \(0\) and \(1\) is called a Boolean function.
Chapter 12: Q1RE (page 844)
Define a Boolean function of degree \({\bf{n}}\).
A function \({\bf{f}}\) in \({\bf{n}}\) variables taking two values \(0\) and \(1\) is called a Boolean function.
All the tools & learning materials you need for study success - in one app.
Get started for freeUse a table to express the values of each of these Boolean functions.
\(\begin{array}{l}{\bf{a) F(x,y,z) = \bar z}}\\{\bf{b) F(x,y,z) = \bar xy + \bar yz}}\\{\bf{c) F(x,y,z) = x\bar yz + }}\overline {{\bf{(xyz)}}} \\{\bf{d) F(x,y,z) = \bar y(xz + \bar x\bar z)}}\end{array}\)
Design a circuit for a light fixture controlled by four switches, where flipping one of the switches turns the light on when it is off and turns it off when it is on.
Show that cells in a \({\bf{K}}\)-map for Boolean functions in five variables represent minterms that differ in exactly one literal if and only if they are adjacent or are in cells that become adjacent when the top and bottom rows and cells in the first and eighth columns, the first and fourth columns, the second and seventh columns, the third and sixth columns, and the fifth and eighth columns are considered adjacent.
What do you think about this solution?
We value your feedback to improve our textbook solutions.