Department of Electrical Engineering
Assignment #2
Solutions
1. I want to schedule a meeting among 6 individuals Alice, Brian, Charles, David, Elise and Frank. The
meeting must be scheduled so that the following rules are satisfied:
•
Exactly one of Alice and Brian must be in the meeting.
•
Charles and David must be present in the meeting together. If Charles is not available, David
and Frank must be in the meeting together. However, all three of Charles, David and Frank must
not be present.
•
Elise is the manager of the group, so she must be present in the meeting.
Each of the 6 team members indicates to me their availability for the meeting. I would like to construct
a logic netlist with a single output
g
, such that
g
is equal to
′
1
′
whenever the meeting can be scheduled.
(a) List the Boolean variables that you will need for the netlist.
(b) Write down what both values of each variable indicate.
(c) Draw the logic netlist using the gate types we discussed in class.
(d) Write down the netlist as a set of logic equations.
Solution.
(a) The input variables are
a
,
b
,
c
,
d
,
e
and
f
. There is a single output variable
g
. Each
variable is a Boolean variable (i.e. it can have one of two values
′
0
′
or
′
1
′
.
(b)
a
= 1
indicates that Alice can attend the meeting.
a
= 0
means that Alice cannot attend.
Similarly for variables
b
,
c
,
d
,
e
and
f
(where each variable corresponds to the first letter of the
name of one of the team members).
The output
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '09
 wilcox
 Electrical Engineering, Boolean Algebra, Boolean function, Sunil P Khatri, minimum SOP expression

Click to edit the document details