University Abdelhamid Mehri Constantine 2

NTIC Faculty
Common Core MI
Module: CRI

Series 3 of Supervised Class Work

(Boolean algebra)

Exercise 1:
The lighting of a lamp is controlled by 3 switches. The lamp comes on if one switch
or all three switches are operated together.
 Find the truth table for the function F which represents the lighting of the lamp (F =
1 for lamp switched-on and F = 0 otherwise).
 Write F as Sop then as Pos.

Exercise 2:
We want to multiply two numbers, each one coded on two bits. The two numbers
are represented by A1 A0 and B1 B0.
1- Determine the number of bits required for the multiplication result.
2- Give the corresponding truth table for the solution to the problem.
3- Find the logic equations for each output bit.

Exercise 3:
A company's Administrative Board is made up of (04) members (X,Y,Z,T). This
board must meet periodically to vote on new management laws for the company. Board
members share the company's capital in the following percentages:
X owns 40% of the shares, Y owns 25%, Z owns 20% and T owns 15%.
During the voting operation, each member has the weight of his shares.
1- Applying the principle of the majority that wins the vote, determine the truth
table that calculates the output function V representing the result of the vote
(V=1 for a yes vote and V=0 for a no vote).
2- Write V as Sop and then as Pos.

Exercise 4:
1- Solve the following equation system of binary variables :

a. X + Y + Z . T = 1
b. X . Y + Z + T = 0
c. (X + Y) . Z + T = 0

1
University Abdelhamid Mehri Constantine 2
NTIC Faculty
Common Core MI
Module: CRI

Exercise 5:

Develop the following expressions :

ABA ABB

AB (A B ) C

XY (X+Y)

Exercise 6:
Using Demorgan's law, show that :

(A + B ) (A+B)=0

A+ AB+ A B=1

Exercise 7:
Using the theorems of Boolean algebra, simplify the following Boolean expressions:

 (A + B) ( B + C) (A + C)

 A B C + A C

 A B D + B C D +B C D + A BD

Exercise 8: X Y Z F
0 0 0 1
Given the following truth table: 0 0 1 0
1- Write F as an algebraic Sop. 0 1 0 1
2- Write F as an algebraic Pos. 0 1 1 0
3- Simplify F algebraically in the form of Pos. 1 0 0 0
4- Let be the Boolean function G(X,Y,Z)= X Y + K such 1 0 1 0
that K represents one or more terms. Determine K
algebraically so that: F+G =1. 1 1 0 1
1 1 1 1

2
University Abdelhamid Mehri Constantine 2
NTIC Faculty
Common Core MI
Module: CRI

Exercise 9:
Simplify the following Boolean functions algebraically:
1- F( A, B, C, D) = min(0, 2, 4, 5, 6, 9, 10)
2- G( A, B, C, D) = ∏Max(1, 3, 5, 7, 9, 10, 11)

Exercise 10:

Let be the Boolean function F: F(x,y,z) = x y + x y z + x y z

1- Write F in the canonical form.
2- Give the truth table for F.
3- Express F in the form of Pos.
4- Algebraically simplify F in the form of Sop.

Exercise 11:
Let A be an integer coded in binary on two bits A1 A0 and let B be its square:
1- Determine the number of bits required to encode the number B in binary form.
2- Determine the truth table for B.
3- Deduce the algebraic equations in Sop for the bits of the number B.
4- Simplify the outputs obtained Algebraically.