Scribd
Upload
36 views21 pages

DM Presentation 1

This document summarizes a presentation on Boolean algebra given by four students to their professor. It introduces Boolean algebra and defines it as a type of algebra that performs logical operations on binary variables represented by 0 and 1. The basic Boolean operations of conjunction, disjunction, and negation are described. Truth tables are provided to illustrate the operations. Boolean expressions and how they are used in programming are explained. Laws of Boolean algebra like distribution, association, commutation, and absorption are outlined. De Morgan's laws are also summarized. The document concludes by discussing applications of Boolean algebra in computer science and its future scope.

Uploaded by

Yashika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
36 views21 pages

DM Presentation 1

This document summarizes a presentation on Boolean algebra given by four students to their professor. It introduces Boolean algebra and defines it as a type of algebra that performs logical operations on binary variables represented by 0 and 1. The basic Boolean operations of conjunction, disjunction, and negation are described. Truth tables are provided to illustrate the operations. Boolean expressions and how they are used in programming are explained. Laws of Boolean algebra like distribution, association, commutation, and absorption are outlined. De Morgan's laws are also summarized. The document concludes by discussing applications of Boolean algebra in computer science and its future scope.

Uploaded by

Yashika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

DISCRETE MATHEMATICS

MID-TERM EVALUATION
(PRESENTATION)
TOPIC:- BOOLEAN ALGEBRA
PRESENTED BY:-
YASHIKA SHUKLA – URN – 2021-B-21042003
ANUSHKA VAIRAT – URN – 2021-B-09052004
SWAPNALI GAVALI – URN – 2021-B-17082003B
SANIYA WAGH – URN – 2021-B-16052003A

PRESENTED TO :- PROF.
SHITAL SOLANKI MAM:
INTRODUCTION :-

• BOOLEAN ALGEBRA CAN BE DEFINED AS A TYPE OF ALGEBRA THAT


PERFORMS LOGICAL OPERATIONS ON BINARY VARIABLES. THESE
VARIABLES GIVE THE TRUTH VALUES THAT CAN BE REPRESENTED
EITHER BY 0 OR 1. THE BASIC BOOLEAN OPERATIONS ARE
CONJUNCTION, DISJUNCTION, AND NEGATION. THE LOGICAL OPERATORS
AND, OR, AND NOT ARE USED TO REPRESENT THESE OPERATIONS
RESPECTIVELY. FURTHERMORE, THESE OPERATIONS ARE ANALOGOUS
TO INTERSECTION, UNION, AND COMPLEMENT OF SETS IN SET THEORY
WORKING :-
• KEEP IN MIND THAT BOOLEAN LOGIC ONLY WORKS WHEN AN
EXPRESSION CAN BE TRUE OR FALSE. FOR EXAMPLE, THE EXPRESSION 3
+ 8 ISN’T A BOOLEAN EXPRESSION BECAUSE IT’S NOT BEING COMPARED
OR RELATED TO SOMETHING ELSE. BUT THE EXPRESSION 3 + 8 = 10 IS A
BOOLEAN EXPRESSION BECAUSE WE CAN NOW EVALUATE EACH SIDE
AND SEE IF THE REPORTED RELATIONSHIP BETWEEN THEM IS TRUE OR
FALSE (IN THIS CASE, IT’S FALSE).
WE CAN BUILD BOOLEAN EXPRESSIONS WITH ALL KINDS OF DATA,
INCLUDING VARIABLES. FOR EXAMPLE, LET’S SUPPOSE THAT WE’VE
ASSIGNED THESE VALUES TO VARIABLES X AND Y SOMEWHERE IN OUR
CODE:
• BOOLEAN EXPRESSIONS CAN ALSO DETERMINE WHETHER TWO STRINGS
ARE IDENTICAL. JUST REMEMBER THAT MOST PROGRAMMING
LANGUAGES ARE CASE-SENSITIVE.
• THERE ARE MANY OTHER WAYS TO BUILD BOOLEAN EXPRESSIONS,
DEPENDING ON THE PROGRAMMING LANGUAGE. FOR EXAMPLE, YOU
COULD USE A BOOLEAN EXPRESSION TO DETERMINE WHETHER A
NUMBER IS CONTAINED WITHIN A LIST IN PYTHON OR WHETHER A TEXT
STRING IS WITHIN A SQL DATABASE TABLE
BOOLEAN ALGEBRA OPERATIONS :-

• THE BASIC OPERATIONS OF BOOLEAN ALGEBRA ARE AS FOLLOWS:


• CONJUNCTION OR AND OPERATION
• DISJUNCTION OR OR OPERATION
• NEGATION OR NOT OPERATION
Below is the table defining the symbols for all three basic operations.

Operator Symbol Precedence

NOT ‘ (or) ¬ Highest

AND . (or) ∧ Middle

OR + (or) ∨ Lowest

Suppose A and B are two Boolean variables, then we can define the three operations as;

 A conjunction B or A AND B, satisfies A ∧ B = True, if A = B = True or else A ∧ B = False.

 A disjunction B or A OR B, satisfies A ∨ B = False, if A = B = False, else A ∨ B = True.

 Negation A or ¬A satisfies ¬A = False, if A = True and ¬A = True if A = False


Now, if we express the above operations in a truth table, we get;
BOOLEAN ALGEBRA TRUTH TABLE :-

A B A∧B A∨B
True True True True
True False False True
False True False True
False False False False

A ¬A
True False
False True
BOOLEAN ALGEBRA LAWS

1. DISTRIBUTIVE LAW
• THE DISTRIBUTIVE LAW SAYS THAT IF WE PERFORM THE AND OPERATION ON TWO VARIABLES
AND OR THE RESULT WITH ANOTHER VARIABLE THEN THIS WILL BE EQUAL TO THE AND OF THE
OR OF THE THIRD VARIABLE WITH EACH OF THE FIRST TWO VARIABLES. THE BOOLEAN
EXPRESSION IS GIVEN AS
• A + B.C = (A + B) (A + C)
• THUS, OR DISTRIBUTES OVER AND
• IF WE OR TWO VARIABLES THEN AND THEIR RESULT WITH ANOTHER VARIABLE THEN THIS VALUE
WILL BE EQUAL TO THE OR OF THE AND OF THE THIRD VARIABLE WITH THE OTHER TWO
VARIABLES. THIS IS GIVEN BY:
• A .(B+C) = (A.B) + (A.C)
• HENCE, AND DISTRIBUTES OVER OR.
ASSOCIATIVE LAW

• ACCORDING TO THE ASSOCIATIVE LAW, IF MORE THAN TWO


VARIABLES ARE OR'D OR AND'D THEN THE ORDER OF GROUPING
THE VARIABLES DOES NOT MATTER. THE RESULT WILL ALWAYS BE
THE SAME. THE EXPRESSIONS ARE GIVEN AS:
• A + (B + C) = (A + B) + C
• A.(B.C) = (A.B).C
COMMUTATIVE LAW

•
COMMUTATIVE LAW STATES THAT IF WE INTERCHANGE THE ORDER
OF OPERANDS (AND OR OR) THE RESULT OF THE BOOLEAN
EQUATION WILL NOT CHANGE. THIS CAN BE REPRESENTED AS
FOLLOWS:
• A+ B= B+A
• A.B = B.A
ABSORPTION LAW

• ABSORPTION LAW LINKS BINARY VARIABLES AND HELPS TO REDUCE


COMPLICATED EXPRESSIONS BY ABSORBING THE LIKE VARIABLES.
THERE ARE 4 STATEMENTS THAT FALL UNDER THIS LAW GIVEN AS:
• A + A.B = A
• A (A + B) = A
• A + Ā.B = A + B
• A.(Ā + B) = A.B
BOOLEAN ALGEBRA THEOREMS :-

• THE TWO IMPORTANT THEOREMS WHICH ARE EXTREMELY USED IN


BOOLEAN ALGEBRA ARE DE MORGAN’S FIRST LAW AND DE
MORGAN’S SECOND LAW. THESE TWO THEOREMS ARE USED TO
CHANGE THE BOOLEAN EXPRESSION. THIS THEOREM BASICALLY
HELPS TO REDUCE THE GIVEN BOOLEAN EXPRESSION IN THE
SIMPLIFIED FORM. THESE TWO DE MORGAN’S LAWS ARE USED TO
CHANGE THE EXPRESSION FROM ONE FORM TO ANOTHER FORM.
De Morgan’s First Law :

De Morgan’s First Law states that (A.B)’ = A’+B’.

The first law states that the complement of the product of the variables is equal to the sum of their
individual complements of a variable.

The truth table that shows the verification of De Morgan’s First law is given as follows:

A B A’ B’ (A.B)’ A’+B’

0 0 1 1 1 1

0 1 1 0 1 1

1 0 0 1 1 1

1 1 0 0 0 0

The last two columns show that (A.B)’ = A’+B’.

Hence, De Morgan’s First Law is proved.


De Morgan’s Second Law:

De Morgan’s Second law states that (A+B)’ = A’. B’.

The second law states that the complement of the sum of variables is equal to the product of their individual
complements of a variable.

The following truth table shows the proof for De Morgan’s second law.

A B A’ B’ (A+B)’ A’. B’
0 0 1 1 1 1
0 1 1 0 0 0
1 0 0 1 0 0
1 1 0 0 0 0

he last two columns show that (A+B)’ = A’. B’.

Hence, De Morgan’s second law is proved.


THE SUM OF MINTERMS (SOM) OR SUM OF
PRODUCTS (SOP) FORM

• A MINTERM IS A PRODUCT OF ALL VARIABLES TAKEN EITHER IN


THEIR DIRECT OR COMPLEMENTED FORM. ANY BOOLEAN A B C Term Mint
erm
FUNCTION CAN BE EXPRESSED AS A SUM OF ITS 1-MINTERMS
0 0 0 x’y’z m0
AND THE INVERSE OF THE FUNCTION CAN BE EXPRESSED AS A ’
SUM OF ITS 0-MINTERMS. HENCE, 0 0 1 x’y’z m1
• F (LIST OF VARIABLES) = ∑ (LIST OF 1-MINTERM INDICES) 0 1 0 x’yz’ m2
• AND 0 1 1 x’yz m3
1 0 0 xy’z’ m4
• F' (LIST OF VARIABLES) = ∑ (LIST OF 0-MINTERM INDICES)
1 0 1 xy’z m5
1 1 0 xyz’ m6
1 1 1 xyz m7
THE PRODUCT OF MAXTERMS (POM) OR
PRODUCT OF SUMS (POS) FORM

• A MAXTERM IS ADDITION OF ALL VARIABLES TAKEN EITHER IN THEIR DIRECT


OR COMPLEMENTED FORM. ANY BOOLEAN FUNCTION CAN BE EXPRESSED AS
A PRODUCT OF ITS 0-MAXTERMS AND THE INVERSE OF THE FUNCTION CAN BE
EXPRESSED AS A PRODUCT OF ITS 1-MAXTERMS. HENCE,
A
F(LIST OF VARIABLES) = Π (LIST OF 0-MAXTERM INDICES). B C Term Maxterm
0 0 0 x+y+z M0
• AND 0 0 1 x + y + z’ M1
0 1 0 x + y’ + z M2
• F'(LIST OF VARIABLES) = Π (LIST OF 1-MAXTERM INDICES).
0 1 1 x + y’ + z’ M3
1 0 0 x’ + y + z M4
1 0 1 x’ + y + z’ M5
1 1 0 x’ + y’ + z M6
1 1 1 x’ + y’ + z M7
CODE (IN C LANGUAGE) :-

// C PROGRAM IMPLEMENTING THE AND GATE AND OR GATE


// THROUGH PRODUCT METHOD
AND SUM METHODS
Output:

0R Operation AND Operation


CONCLUSION :-

• BOOLEAN ALGEBRA HAS NOW BECOME AN


INDISPENSABLE TOOL IN COMPUTER SCIENCE FOR
ITS WIDE APPLICABILITY. BY USING THE CODE IN
THE PRESENTATION THE TRUTH VALUE OF THE
BOOLEAN OPERATION CAN BE CALCULATED.
FUTURE SCOPE :-

• WE CAN USE BOOLEAN ALGEBRA IN PROGRAMMING FOR


TRUE OR FALSE STATEMENT .OR WE CAN ALSO USE
BOOLEAN ALGEBRA FOR IF OR ELSE STATEMENT FOR
MORE COMPLICATED CODING .
THANK
YOU

You might also like