TOPIC NAME:- MOTIVATION FOR DIGITAL

SYSTEM

PRESENTED BY:-
1). MR. PREM GAJANANRAO YELKAR
2). MR. AYUSH MUKINDRAO PUNVATKAR
3). MR. YOGESH NARAYANRAO BHOYAR
4). MR. ABHIJEET SANDIP WANKHEDE
5). MISS. AKANSHA HAWALADAR
 *INTRODUCTION:-
• BOOLEAN ALGEBRA WAS INTRODUCED BY GEORGE BOOLE IN 1854.
• A LOGIC GATES IS A DEVICE THAT ACTS AS A BUILDING BLOCK FOR DIGITAL
CIRCUIT.
• A TRUTH TABLE IS A LISTING OF ALL POSSIBLE COMBINATIONS OF THE
INDIVIDUAL STATEMENTS AS TRUE OR FALSE ALONG WITH THE RESULTING
TRUTH VALUE OF THE COMPOUND STATEMENTS.
• THEOREM’S ARE TWO ADDITIONAL SIMPLIFICATION TECHNIQUES THAT CAN
BE USED TO SIMPLIFY BOOLEAN EXPRESSION.
* CONTENT:-
• Logic And Boolean Algebra
• Logic Gates & Truth Tables
• Demorgan’s Law
LOGIC GATES AND BOOLEAN ALGEBRA

• BOOLEAN ALGEBRA IT IS USE TO ANALYSIS AND SIMPLIFY THE DIGITAL

LOGIC CIRCUIT.
• IT IS USE ONLY THE BINARY NUMBER THAT IS 0 AND 1.IT IS ALSO CALLED
AS THE BINARY ALGEBRA AND LOGICAL ALGEBRA.
 APPLICATION OF BOOLEAN ALGEBRA

1). IT IS USE TO PERFORM THE LOGICAL OPERATION IN DIGITAL

COMPUTER
2). IN DIGITAL COMPUTER TRUE REPRESENTED BY 1.(HIGH VOLT)
AND 0 REPRESENTED BY FALSE(LOW).
 THE FUNDAMENTAL LOGICAL OPERATION ARE

1.AND:-(CONJUNTION) MUTLIPLICATION AND

OPERATION PERFORM LOGICAL MULTIPLICATION AND DENOTED BY(.) DOT.

TRUTH TABLES
X Y XY
0 0 0
0 1 0
1 0 0
1 1 1
 THE FUNDAMENTAL LOGICAL OPERATION ARE

2 .OR:-(DISJUNCTION) ADDITION IT PERFORM LOGICALLY ADDITION AND

DENOTED BY(+).

TRUTH TABLES

X Y X+Y
0 0 0
0 1 1

1 0 1
1 1 1
THE FUNDAMENTAL LOGICAL OPERATION ARE

3.NOT:-(NEGATION) SUBSTRACTION.IT PERFORM LOGICAL NEGATION AND DENOTED BY (-)

BAR

TRUTH TABLE

X X
0 1
1 0
 TRUTH TABLE :-
• DEFINATION:- TRUTH TABLE IS A TABLE THAT CONTENT ALL THE POSSIBLE
VALUE OF LOGICAL

X Y Z XY XY+Z
0 0 0 0 0
0 0 1 0 1
0 1 0 0 0
0 1 1 0 1
1 0 0 0 0
1 0 1 0 1
1 1 0 0 0
1 1 1 1 1
 TAUTOLOGY AND FALLACY:-
• IF THE OUTPUT OF BOOLEAN EXPRESSION ALWAYS TRUE OR 1
IS CALLED TOTOLOGY
• IF THE OUTPUT OF BOOLEAN EXPRESSION ALWAYS FALSE OR 0
IS CALLED AS FALSY
 LOGIC GATE

1. A GATE IS AN A DIGITAL CIRCUIT WHICH OPERATES ON ONE

OR MORE SIGNAL AND PRODUCE 1 SINGAL OUTPUT.
2. GATES ARE DIGITAL CIRCUIT BECAUSE THE INPUT AND
OUTPUT SIGNAL DENOTED BY 0 AND 1.
 AND
TYPES OF GATES
GATE
1. AND GATE IS AN ELECTRONIC CIRCUIT THAT GIVES THE HIGH OUTPUT (1) ONLY IF ALL IT’S
INPUT ARE HIGH.
2. AND GATE TAKE TWO OR MORE INPUT SIGNAL AND PRODUCE ONLY ONE OUTPUT SIGNAL.

TRUTH TABLE
A B A.B
0 0 0
0 1 0
1 0 0
1 1 1
 OR
TYPES OF GATES GATE
1.OR GATES IS AN ELECTRONIC CIRCUITS PRODUCE THAT GIVES THE HIGH
OUTPUT (1) ONLY IF IT’S INPUT ARE HIGH.
2. OR GATES TAKE TWO OR MORE INPUT SIGNAL AND PRODUCE ONLY ONE
OUTPUT SIGNAL.
TRUTH TABLE:-
A B A+B

0 0 0

0 1 1

1 0 1

1 1 1
 NOT
TYPES OF GATES GATE
1.THE NOT GATES IS ON ELETRONIC CIRCUIT THAT GIVES THE HIGH AT OUTPUT IS
1 IF IT INPUT IS LOW.
2. THE OUTPUT OF NOT GATES IT COMPLIMENT OF IN INPUT IS IT ALSO CALLED AS
INVATOR.

TRUTH TABLE:-
A A

0 1

1 0
 *DEMORGAN’S THEOREM 1
THEOREM 1):- COMPLIMENT OF A PRODUCT IS EQUAL TO THE ADDITION OF THE
COMPLIMENT.
 * DEMORGAN’S THEOREM 2
THEOREM 2):-COMPLIMENT OF THE SUM IS EQUAL TO THE PRODUCT OF
COMPLIMENT
 *CONCLUSION:-

1). BOOLEAN ALGEBRA IS A MATHEMATICAL SYSTEM TO STUDY LOGIC

CIRCUITS.
2). A NOT GATE INVERTS ITS SINGLE VALUES
AN AND GATE PRODUCES 1 IF BOTH INPUT VALUES ARE 1
AN OR GATE PRODUCES 1 IF ONE OR THE OTHER OR BOTH
INPUT VALUES ARE 1
3). ONE OF THE MOST USEFUL PRINCIPLE IN BOOLEAN ALGEBRA IS
DEMORGAN’S THEOREM, WHICH ALLOW ONE TO SWITCH BETWEEN ANDs AND
NORs AND ORs AND NANDs.
 BY

THANK YOU !