These data are shown on the minterm map in
Figure 3a .
We use the patterns displayed in the minterm map to aid in an algebraic solution forthe various minterm probabilities.
Thus, all minterm probabilities are determined. They are displayed in
Figure 3b . From
these we get
Survey on personal computers
A survey of 1000 students shows that 565 have PC compatible desktop computers,
515 have Macintosh desktop computers, and 151 have laptop computers. 51 have all three,124 have both PC and laptop computers, 212 have at least two of the three, and twice
as many own both PC and laptop as those who have both Macintosh desktop and laptop.A person is selected at random from this population.
What is the probability he or she has at least one of these types of computer? Whatis the probability the person selected has only a laptop?
SOLUTION
Let
the event of owning a PC desktop,
the event of owning a Macintosh
desktop, and
the event of owning a laptop. We utilize a minterm map for
three variables to help determine minterm patterns. For example,the event
so that
.
The data, expressed in terms of minterm probabilities, are:
, hence
, hence
, hence
We use the patterns displayed in the minterm map to aid in an algebraic solution for
the various minterm probabilities.
We have determined the minterm probabilities, which are displayed
on the minterm map
[link] . We may now compute the probability of any
Boolean combination of the generating events
. Thus,
A survey of 1000 persons is made to determine their opinions onfour propositions. Let
be the events a person selected agrees with
the respective propositions. Survey results show the following probabilities forvarious combinations:
Determine the probabilities for each minterm and for each of the following combinations
– that is, not
A and (
B or
C , but not both)
– that is,
A or (
B and not
C )
SOLUTION
At the outset, it is not clear that the data are consistent or sufficient to determine the minterm
probabilities. However, an examination of the data shows that there are sixteen items (includingthe fact that the sum of all minterm probabilities is one). Thus, there is hope, but no
assurance, that a solution exists. A step elimination procedure, as in the previous examples,shows that all minterms can in fact be calculated. The results are displayed on the minterm
map in
[link] . It would be desirable to be able to analyze the problem systematically.
The formulation above suggests a more systematic algebraic formulation which should makepossible machine aided solution.
Use of a minterm map has the advantage of visualizing the minterm expansion in
direct relation to the Boolean combination. The algebraic solutions of the previousproblems involved
ad hoc manipulations of the data minterm probability
combinations to find the probability of the desired target combination. We seeka systematic formulation of the data as a set of linear algebraic equations with
the minterm probabilities as unknowns, so that standard methods of solution may beemployed. Consider again the software survey of
[link] .
The software survey problem reformulated
The data, expressed in terms of minterm probabilities, are:
, so that
We also have in any case
to complete the eight items of data needed for determining all eight minterm
probabilities. The first datum can be expressed as an equation in mintermprobabilities:
This is an algebraic equation in
with a matrix of coefficients
The others may be written out accordingly, giving eight linear algebraic equations
in eight variables
through
. Each equation has a matrix or vector of zero-one coefficients
indicating which minterms are included. These may be written in matrix form as follows:
The patterns in the coefficient matrix are determined by
logical operations . We
obtained these with the aid of a minterm map.
The solution utilizes an
algebraic procedure , which could be carried out in
a variety of ways, including several standard computer packages for matrix operations.
Previous discussion of the indicator function shows that the indicator function
for a Boolean combination of sets is a numerical valued function of the indicatorfunctions for the individual sets.
As an indicator function, it takes on only the values zero and one.
The value of the indicator function for any
Boolean combination must be constant on each minterm. For example, for each
ω in the minterm
,
we must have
, and
. Thus, any function of
must
be constant over the minterm.
Consider a Boolean combination
E of the generating sets. If
ω is
in
, then
for all
, so that
. Since each
for some
must be the
union of those minterms sharing an
ω with
E .
Let
be the subclass of those minterms on which
I
E has
the value one. Then