Sana'a University

Faculty of Engineering
Mechatronics Department
Second Year

DIGITAL LOGIC CIRCUIT DESIGN

EXPERIMENT #2

BOOLEAN ALGEBRA

Prepared by: Supervised by :

Osama Mohammed Mahyoub Eng.Essam Almizgagi
(2017/162)
II. Design of a Digital Circuit
Consider the following problem:

Four chairs A, B, C, and D are placed in a row. Each chair may be occupied (“l”) or empty
(“0”). A Boolean function F is “l” if and only if there are two or more adjacent chairs that
are empty.

1. Give the truth table defining the Boolean function F.

A B C D F
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0

2. Express F as a minterm expansion (standard sum of product).

F as a standard SOP:

̅ +𝑨
𝑨𝑫 ̅𝑩 ̅𝑫 + 𝑨
̅𝑪 ̅𝑩̅ 𝑪𝑫
̅ +𝑨
̅𝑩̅ 𝑪𝑫 + 𝑨 ̅𝑫
̅ 𝑩𝑪 ̅ + 𝑨𝑩
̅𝑪̅𝑫
̅ + 𝑨𝑩
̅𝑪̅ 𝑫 + 𝑨𝑩𝑪
̅𝑫̅

3. Express F as a maxterm expansion (standard product of sum).

F as a standad POS:

𝑨 ̅𝑫 + 𝑨
̅ 𝑩𝑪 ̅ 𝑩𝑪𝑫
̅ +𝑨
̅ 𝑩𝑪𝑫 + 𝑨𝑩
̅ 𝑪𝑫
̅ + 𝑨𝑩 ̅ 𝑫 + 𝑨𝑩𝑪𝑫
̅ 𝑪𝑫 + 𝑨𝑩𝑪 ̅ + 𝑨𝑩𝑪𝑫
 4. Using postulates and theorems of Boolean algebra, simplify the minterm expansion
of F to a form with as few occurrences of each as possible.

Using theorems of Boolean algebra, we get the simplified form of SOP:

̅𝑩
𝑨 ̅ +𝑩
̅𝑪̅+𝑪
̅𝑫̅

5. Implement on LogicWorks for the pre-lab and then on PB-503, the simplified
Boolean function with logic gates and check the operation of the circuit.

We note that the Probe is “1” if and only if there are two or more adjacent chairs
that are empty (two or more adjacent zeros):

1
0

1
0
1
1
0

1
0

If there is no two adjacents zeros, the Probe will show “0” as an output:

1
0

1
0
0
1
0

1
0