Contents

IV. Boolean algebra

I . Introduction Introduction
II. Number Systems
Digital machines (computer, tablet, telephone, etc.) are
III. Information’s
made of a set of electronic circuits.
representation
Each circuit provides a well-defined logical function; logical or
IV. Boolean algebra
arithmetic operations (addition, subtraction, comparison, etc.).
Introduction
1. Basics
Illustration The following diagram shows a simple circuit:
2. Logical operators
3. Logical expressions A
Circuit F(A, B)
4. Logical functions
B
A. Representation
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction Introduction
II. Number Systems
To design and build a circuit we must
III. Information’s
have a mathematical model. The
representation
mathematical model used is that of
IV. Boolean algebra Boole.
Introduction
It involves applying a set of rules from mathematics to logical
1. Basics
variables. This algebra was created by the English
2. Logical operators
mathematician George Boole (1815-1864)
3. Logical expressions
Objective of Boolean algebra:
4. Logical functions
1. The design of electronic circuits.
A. Representation
2. The simplification of logical functions in order to build circuits
B. Simplification
with the minimum of components.

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction Introduction
II. Number Systems
III. Information’s Content of the chapter: in this chapter we will see
representation 1. Basics: Logic variable, logic state, logic operators, logic gate,
IV. Boolean algebra logic function.
Introduction 2. Logical operators: (basic, compounds)
1. Basics 3. Manipulation of Boolean expressions (Postulates, Axioms,
2. Logical operators Theorems)
3. Logical expressions 4. The representation of logical functions: truth table,
4. Logical functions algebraic equations, logigram, chronogram.
A. Representation 5. Simplification of logical functions: The algebraic method,
B. Simplification
and the Karnaugh table method

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 1. Basics
II. Number Systems
Logic variable: Quantity represented by a symbol, which can take two
III. Information’s distinct logical values ​(or states).
representation
Logic state: Value of a logical variable (true or false) represented by the
IV. Boolean algebra
numbers “0” or “1” or by the letters “L” or “H”.
Introduction
(H=High; L=Low).
1. Basics
Logical operator: Takes one or more logic values ​as input and provides
2. Logical operators a single logic value as output. There are two types of operators: basic
3. Logical expressions and compound.
4. Logical functions Logic Gate: This is a graphical representation of a logic operator.
A. Representation
Logical function: Expression of input variables and operators. It gives
B. Simplification
for each value of the input variables a single output value.

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 2. Logical operators
II. Number Systems
2.1. Basic Operators :
III. Information’s
1. Negation: Unary operator. It allows you to invert the value of a
representation
variable. The negation of the variable A is represented by
IV. Boolean algebra
It is defined as follows:
Introduction
I O O=
1. Basics 0 1
1 0
2. Logical operators
3. Logical expressions
2. Disjunction (or): Binary operator which makes the logical sum of
4. Logical functions
two variables. It is represented by (+).
A. Representation
A B S = A+B
B. Simplification 0 0 0
A
0 1 1 S
1 0 1 B
1 1 1

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 2. Logical operators
II. Number Systems
2.1. Basic Operators :
III. Information’s
3. The conjunction (and): Binary operator which makes the logical
representation
product of two variables. It is represented by (.)
IV. Boolean algebra
Introduction A B S = A.B
0 0 0
A
1. Basics 0 1 0 S
B
2. Logical operators 1 0 0
1 1 1
3. Logical expressions
4. Logical functions
A. Representation
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 2. Logical operators
II. Number Systems
2.2. Compound operators :
III. Information’s
4. NOR operator (Not Or): Binary operator which negates the OR
representation operator, it is represented by : 𝐴 + 𝐵 = 𝐴 ↓ 𝐵 ,
IV. Boolean algebra it is defined A B S=A+B
Introduction as following : 0 0 1
0 1 0 A
1. Basics B S
1 0 0
2. Logical operators 1 1 0

3. Logical expressions 5. NAND operator (Not And): Binary operator which negates the
4. Logical functions AND operator, it is represented by 𝐴 . 𝐵 = 𝐴 ↑ 𝐵 ,
A. Representation it is defined A B S=A.B
as following : 0 0 1
B. Simplification A
0 1 1 S
1 0 1 B
1 1 0

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 2. . Logical operators
II. Number Systems
2.2. Compound operators :
III. Information’s
5. XOR operator (exclusive Or): Binary operator which returns 1 if
representation the input values ​are different, it is represented by :
IV. Boolean algebra , A B S=A B
Introduction it is defined 0 0 0
0 1 1 A S
1. Basics as following : B
1 0 1
2. Logical operators 1 1 0

3. Logical expressions
6. NXOR operator (Negation of Exclusive Or): Binary operator which
4. Logical functions
returns 1 if the input values ​are identical, it is represented by :
A. Representation
A B S=A B
B. Simplification 0 0 1 A S
0 1 0 B
it is defined 1 0 0
as following : 1 1 1

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 3. Logical expressions
II. Number Systems
3.1. Postulates : Disjunction (+) Conjunction (.)
III. Information’s
1+1=1 1.1=1
representation 1+0=0+1=1 1.0=0.1=0
IV. Boolean algebra 0+0 =0 0.0 =0

Introduction 1 = 0 0 = 1
3.2. Axioms :
1. Basics
Property Disjunction (+) Conjunction (.)
2. Logical operators
Commutativity A+B=B+A A.B=B.A
3. Logical expressions Associativity A+(B+C) = (A+B)+C A.(B.C) = (A.B).C
4. Logical functions Distributivity A+(B.C) = (A+B).(A+C) A.(B+C) = A.B+A.C
Neutral element A+0 = A A.1 = A
A. Representation
Absorbent element A+1 = 1 A.0 = 0
B. Simplification
Complementation
Idempotence A+A = A A.A = A
Involution

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 3. Logical expressions
II. Number Systems
3.3. Theorems :
III. Information’s
A. DE Morgan Theorem :
representation
IV. Boolean algebra
Introduction B. Inclusion theorem :
1. Basics
2. Logical operators C. Elimination theorem :
3. Logical expressions
4. Logical functions
A. Representation D. Absorption theorem :
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 3. Logical expressions
II. Number Systems
3.3. Theorems :
III. Information’s
E. Duality theorem : Each axiom and each postulate has a dual
representation
equivalent, where the elements 0 are replaced by 1s, the 1s by 0s, the
IV. Boolean algebra
( · ) by ( + ) and vice versa. Also, every theorem of Boolean algebra has
Introduction its dual equivalent.
1. Basics
2. Logical operators Example : A+A.B = A equal to A.(A+B) = A

3. Logical expressions A + 1 = 1 equal to A.0 = 0

4. Logical functions
F. Michaud's reflection :
A. Representation
B. Simplification If A = B C Then : B = A C

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
Definition : a logical function is a set of logical variables linked
III. Information’s together by logical operators.
representation A. Representation : a logical function can be represented by a logical
IV. Boolean algebra expression (Boolean), by its truth(fact) table, by a circuit, or by a
Introduction chronogram.
1. Basics The truth (fact) table : it presents the different values ​of a function
2. Logical operators according to the different combinations of its input variables.
3. Logical expressions The flowchart (logic circuit) : is a graphic representation of a function.
4. Logical functions This involves connecting the input variables with logical operators to
A. Representation give the values ​of the output function.

B. Simplification The chronogram : It is a diagram which presents the evolution of the

input and output variables over time, such that the High state
represents '1' and the Lower state represents '0'.

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s
representation Example : Let the logical function
IV. Boolean algebra Draw the truth table of F then design its flowchart and chronogram.

Introduction
A B C F(A,B, C) A
1. Basics B
0 0 0 1
2. Logical operators F
0 0 1 0 C
3. Logical expressions
0 1 0 1
4. Logical functions 0 1 1 0
C 0 1 0 1 0 1 0 1
A. Representation 1 0 0 1
B 0 0 1 1 0 0 1 1
B. Simplification 1 0 1 0
A 0 0 0 0 1 1 1 1
1 1 0 1
1 1 1 1 F 1 0 1 0 1 0 1 1

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s
Canonical Forms :
representation
 We call Minterm of n variables a logical product of these variables.
IV. Boolean algebra
Introduction
Example 1 : n =2 (A, B) So Are Minterms
1. Basics
Are not Minterms
2. Logical operators
3. Logical expressions Example 2 : n =3 (A, B,C) So
4. Logical functions
A. Representation
B. Simplification
Are Minterms

Are not Minterms

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s
Canonical Forms :
representation
 We call Maxterm of n variables a logical sum of these variables.
IV. Boolean algebra
Introduction
Example 1 : n =2 (A, B) So
1. Basics
Are Maxterms
2. Logical operators
3. Logical expressions Are not Maxterms
4. Logical functions Exemple 2 : n =3 (A, B,C) alors
A. Representation
B. Simplification Are Maxterms
Are not Maxterms

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s
Canonical Forms :
representation
 With n variables we can form different Minterms .
IV. Boolean algebra
 With n variables we can form different Maxterms .
Introduction
 The representation of a function as a sum of Minterm is called the
1. Basics
canonical disjunctive form (Sum Of Products). We note it by SOP.
2. Logical operators
3. Logical expressions  The representation of a function as product of Maxterms is called
4. Logical functions the canonical conjunctive form (Product Of Sums). We note it by POS.
A. Representation
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s
Canonical Forms :
representation
 To transform a non-canonical disjunctive function into a canonical
IV. Boolean algebra
disjunctive function, we multiply each Minterm of the function by the
Introduction
sum of the missing variable and its complement.
1. Basics
Example
2. Logical operators
3. Logical expressions
4. Logical functions
A. Representation
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s
Canonical Forms :
representation
 To transform a non-canonical conjunctive function into a canonical
IV. Boolean algebra
conjunctive function, we add each Maxterm of the function by the
Introduction
product of the missing variable and its complement.
1. Basics
Example
2. Logical operators
3. Logical expressions
4. Logical functions
A. Representation
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s Extraction of a function from its truth table : To obtain the logical
representation expression under SOP (disjunctive), we add up the Minterms for which
IV. Boolean algebra the function is 1.
Introduction Example: the function of the Previous Example :
1. Basics A B C F(A,B, C)

2. Logical operators 0 0 0 1
0 0 1 0 So SOP
3. Logical expressions
0 1 0 1
4. Logical functions
0 1 1 0
A. Representation 1 0 0 1
B. Simplification 1 0 1 0
1 1 0 1
1 1 1 1

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s Extraction of a function from its truth table : To obtain the logical
representation expression under POS (conjunctive), we first obtain the SOP of the
IV. Boolean algebra function by adding up the Minterms for which the output is 0. Then
Introduction we calculate by applying DE Morgan's theorem.
1. Basics Consider the same previous example
A B C F(A,B, C)
2. Logical operators
0 0 0 1
3. Logical expressions 0 0 1 0
4. Logical functions 0 1 0 1
A. Representation 0 1 1 0
1 0 0 1
B. Simplification
1 0 1 0 = POS(F)
1 1 0 1
1 1 1 1

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s
Extraction of a function from its truth table :
representation
 We call the Decimal Form of the canonical disjunctive form DF1 the
IV. Boolean algebra
sum of the decimal numbers equivalent to the Minterms of the
Introduction
function where 𝐴 is represented by 1 and is represented by 0.
1. Basics
Example 1 : the Minterm A.B.C is represented by (011)2 = (3)10
2. Logical operators
3. Logical expressions Example 2 :
000 010 100 110 111
4. Logical functions
A. Representation DF1
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
A. Representation :
III. Information’s
Extraction of a function from its truth table :
representation
 We call the Decimal Form of the canonical conjunctive form DF2 the
IV. Boolean algebra product of the decimal numbers equivalent to the Maxterms of the
Introduction function where 𝐴 is represented by 0 and is represented by 1.
1. Basics
Example 1 : the Maxterm A+B+C is represented by (100)2 = (4)10
2. Logical operators
3. Logical expressions Example 2 :
4. Logical functions 001 011 101

A. Representation
DF2
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions : Two methods exist :
III. Information’s
algebraic simplification, graphic simplification (of KARNAUGH).
representation
IV. Boolean algebra B.1. Algebraic simplification: Consists of using the rules (which we
Introduction
have seen) allowing you to manipulate Boolean expressions.

1. Basics
Example :
2. Logical operators
3. Logical expressions
4. Logical functions
A. Representation
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) : is a simple
representation method which consists of using a KARNAUGH table. This table can be
IV. Boolean algebra seen as a particular two-dimensional truth table in which a certain
Introduction number of variables are used to identify the columns and the others
1. Basics to identify the rows. Exp:
2. Logical operators
AB 00 01 11 10 AB 00 01 11 10
3. Logical expressions CD C
00 0
4. Logical functions 01 1
11
A. Representation 10
B. Simplification
For a function with 2*N or 2*N +1 variables, then N or N+1 variables
are used to identify the columns and N variables are used to identify
the rows of the table.
L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef
 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
IV. Boolean algebra AB 00 01 11 10 AB 00 01 11 10
CD C
Introduction 00 0
01 1
1. Basics 11
10
2. Logical operators
3. Logical expressions Each elementary box corresponds to a single row and a single column,
4. Logical functions therefore to a single combination of variables.
A. Representation
This method was developed by Maurice Karnaugh in 1953, it works
B. Simplification very well with 2, 3 or 4 variables, much less with 5 or 6 variables, and
not at all beyond that.

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Adjacency of cells : Two cells are adjacent in the Karnaugh table if
IV. Boolean algebra
they correspond to combinations differing by a single bit.
Introduction
1. Basics
Examples of adjacent cells : in each table, the cells in Green are
2. Logical operators
adjacent to the cell that contains the letter X, however those in orange
3. Logical expressions
are not.
4. Logical functions
Table with two variables :
A. Representation
B. Simplification A 0 1 A 0 1 A 0 1 A 0 1
B B B B
0 x 0 x 0 0
1 1 1 x 1 x

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Adjacency of cells : Table with three variables :
IV. Boolean algebra
Introduction
AB 00 01 11 10 AB 00 01 11 10
1. Basics C C
2. Logical operators 0 x 0 x
1 1
3. Logical expressions
4. Logical functions
AB 00 01 11 10 AB 00 01 11 10
A. Representation
C C
B. Simplification 0 0
1 x 1 x

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Adjacency of cells : Table with four variables :
IV. Boolean algebra
Introduction
AB 00 01 11 10 AB 00 01 11 10
1. Basics CD CD
00 x 00 x
2. Logical operators 01 01
11 11
3. Logical expressions
10 10
4. Logical functions
A. Representation AB 00 01 11 10 AB 00 01 11 10
CD CD
B. Simplification 00
00
01 x 01
11 11 x
10 10

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Simplification procedure :
IV. Boolean algebra
Introduction 1. Draw the Karnaugh table, from the T.T
1. Basics 2. Group adjacent cells containing 1, thus :
2. Logical operators  The number of cells in each group must be power of 2
3. Logical expressions
 We make the minimum number of groups that cover the
4. Logical functions
maximum number of cells.
A. Representation
 A cell containing 1 must appear in, at least, one group. It can
B. Simplification
exist in several groups.
 Stop grouping if all cells with 1 are grouped.

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Simplification procedure :
IV. Boolean algebra
Introduction 1. Draw the Karnaugh table, from the T.T
1. Basics 2. Group adjacent cells containing 1
2. Logical operators 3. Simplified function extraction
3. Logical expressions
The function is generally represented as a sum of products,
4. Logical functions where each group represents a product of the input variables, a
A. Representation variable which changes state in the group must be eliminated
B. Simplification from the product.

In the rest of this chapter we will present examples :

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Examples (case of a function with 2 variables)
IV. Boolean algebra
Introduction
1. Basics A B F(A,B)

2. Logical operators 0 0 1 A 0 1
B
3. Logical expressions 0 1 0
1 0 1 0 1 1
4. Logical functions
1 1 0 1 0 0
A. Representation
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Examples (case of a function with 3 variables)
IV. Boolean algebra
Introduction
1. Basics A B C F(A,B, C)
0 0 0 0 AB 00 01 11 10
2. Logical operators
0 0 1 0 C
3. Logical expressions
0 1 0 0
0 0 0 1 1
4. Logical functions 0 1 1 0 1 0 0 1 0
A. Representation 1 0 0 1

B. Simplification 1 0 1 0
1 1 0 1
1 1 1 1

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
A B C D F(A,B, C,D)
0 0 0 0 0
Examples (case of a function with 4 variables)
IV. Boolean algebra
0 0 0 1 0
Introduction 0 0 1 0 0
0 0 1 1 0
1. Basics
0 1 0 0 1
2. Logical operators 0 1 0 1 1
0 1 1 0 0 AB 00 01 11 10
3. Logical expressions 0 1 1 1 0
CD

4. Logical functions 1 0 0 0 0 00 1 1
1 0 0 1 1 01 1 1 1
A. Representation 1 0 1 0 0 11 1
1 0 1 1 0 10 1
B. Simplification
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Examples (case of a function with 5 variables)
IV. Boolean algebra
Introduction
1. Basics
2. Logical operators
3. Logical expressions
4. Logical functions
A. Representation
B. Simplification

Conclusion : Simplifying F consists of simplifying F1 and F2

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Examples (case of a function with 6 variables)
IV. Boolean algebra
Introduction Simplifying the function F(A, B, C, D, E, F) consists to put it in
1. Basics this format :
2. Logical operators
3. Logical expressions
4. Logical functions
Then to simplify the functions F1, F2, F3, F4
A. Representation
B. Simplification

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef

 Contents
IV. Boolean algebra
I . Introduction 4. Logical Functions
II. Number Systems
B. Simplification of logical functions
III. Information’s
B.2. graphic simplification (Method of KARNAUGH) :
representation
Special case (Undetermined values)
IV. Boolean algebra
It sometimes happens that a function is undefined for certain
Introduction
combinations of variables, for different reasons; the most common is
1. Basics that certain combinations of variables are impossible. And we do not
2. Logical operators consider it useful to give a particular value to the function for these
3. Logical expressions combinations.
4. Logical functions
In the corresponding cells of the Karnaugh table, we place a
A. Representation
particular sign (X: indeterminate value), then during the cells grouping
B. Simplification phase, we have the choice to group (or not) cells that contain X.

End of course

L1 ( Computer Science ) //// 2023/ 2024 Mr. BARR Youcef