TOPIC (Unit 2)

Digital Electronics

1s and 2s complement, Binary addition, subtraction, multiplication,

division, Boolean algebra, Logic gates, Basic gates, Universal gates,
Special-purpose gates with truth table, symbols and logic
expressions.

B.E.-CSE 1st Sem.

Department of Interdisciplinary Courses in Engineering (DICE)

&
Department of Computer Science and Engineering
1
BINARY ARITHEMATIC

2
 Binary Addition Rules

1 + 1 = 0 with carry 1
1+0=1
0+1=1
0+0=0

3
Binary Addition Examples

4
Binary Subtraction Rules

0-0=0
1-1=0
1-0=1
0 - 1 = 1 with borrow 1

5
Binary Subtraction Examples

6
Binary Multiplication Rules

1×1=1
1×0=0
0×1=0
0×0=0

7
Binary Multiplication Example

101001
× 110
________________
000000
101001
+101001
_________________
11110110

8
Binary Division Rules

1÷1=1
1 ÷ 0 = undefined
0÷1=0
0 ÷ 0 = undefined

9
Binary Division Example

10
COMPLEMENTATION
METHOD

11
 1s Complement

In a given binary number if 1 is replaced by zero and

zero is replaced by 1 then we get 1’s complement of
that number.

E.g. :
(10011)
1’s complement is (01100)

12
 2s Complement
If we add 1 in 1’s complement then we get 2’s complement ie
1’s complement plus 1 is known as 2’s complement.

E.g. (10110)

Step 1:
Take 1’s complement of given number: 01001

Step 2:
2’s complement = 1’s complement + 1
= (01001 + 1)
= (01010)

13
LOGIC GATES

14
 LOGIC GATES
It is an electronic or logic circuit having one or
more then one inputs and only one output.
Logic gates are the basic building blocks of any
digital circuit.
There are three types of logic gates:
1. Basic gate
2. Universal gate
3. Special purpose gate
15
 BASIC GATES
It is an electronic circuit which is used to
perform basic operation is known as basic gate.
There are three types of basic gates:
1. AND gate
2. OR gate
3. NOT gate

16
 AND GATE
• It is a basic gate which is used to perform AND (*) operation.
• An AND gate has two or more inputs and a single output.
• In this gate, the output is 1 when all the inputs are 1.
• In other words, the output is high when all the inputs are high.
• The most commonly used symbol for an AND gate is as shown with
inputs A and B , output Y.

17
 OR GATE
• It is a basic gate which is used to perform OR(+) operation.
• The OR gate is a digital logic gate with minimum 2 inputs and one output.
The output of the OR gate is true only when one or more inputs are true.
• If all the inputs of the gate are false, only then the output of the is false.
The symbol and truth table of an OR gate with two inputs is shown.

18
 NOT GATE
• It is a basic gate which is used to perform NOT(complementation)
operation.
• The NOT gate is a digital logic gate with one input and one output that
operates an inverter operation of the input.
• The output of the NOT gate is the reverse of the input.
• When the input of the NOT gate is true then the output will be false and
vice versa.

19
PRACTICAL APPLICATIONS
OF GATES

20
Practical Application of AND Gate

So while going out of the house you set the "Alarm

Switch" and if the burglar enters he will set the "Person
switch", and the alarm will ring.

21
Practical Application of OR Gate

You would of course want your doorbell to ring when someone

presses either the front door switch or the back door switch.

22
Practical Application of NOT Gate

When the temperature falls below 20 degrees, the Not gate will
set on the central heating system.

23
UNIVERSAL GATES

24
 Universal Gates

NAND and NOR are known as universal gate

because using either NAND or NOR we can
implement all the three basic gates. There are two
universal gates:

1. NAND Gate
2. NOR Gate

25
 NAND GATE

• It is a universal gate that is used to perform NAND (AND +NOT)

operation.

• The output of NAND gate is 1 when any one input or more than one input
are 0.

26
 NOR GATE

• It is a universal gate that is used to perform NOR (OR+NOT) operation.

• The output of NOR gate is 1 when all the inputs are 0.

27
Special Purpose Gates

X-OR and X-NOR are known as special purpose

gate, because it is used in digital circuits to reduce
hardware part of some digital circuits. There are
two special types of special purpose gate
1. X-OR Gate
2. X-NOR Gate

28
 EX-XOR GATE
• It is a special purpose gate which is used to perform X OR operation.
• XOR gate (sometimes EOR, or EX OR and pronounced as Exclusive OR)
is a digital logic gate that gives a true (1 or HIGH) output when the
number of true inputs is odd.
• An XOR gate implements an exclusive or; that is, a true output results if
one, and only one, of the inputs to the gate is true.

29
 EX-NOR GATE

• It is a special purpose gate which is used to perform X -

NOR operation.

• Is a digital logic gate, that performs X-NOR operation that is

the logical complement of the Exclusive OR (XOR) gate.

30
Basic Theorems of Boolean
Algebra

31
 Boolean Algebra

• T1 : Properties of 0
(a) 0 + A = A
(b) 0 A = 0
• T2 : Properties of 1
(a) 1 + A = 1
(b) 1 A = A

32
 Boolean Algebra

• T3 : Commutative Law
(a) A + B = B + A
(b) A B = B A
• T4 : Associate Law
(a) (A + B) + C = A + (B + C)
(b) (A B) C = A (B C)
• T5 : Distributive Law
(a) A (B + C) = A B + A C
(b) A + (B C) = (A + B) (A + C)
(c) A+A’B = A+B

33
 Boolean Algebra

• T6 : Indempotence (Identity ) Law

(a) A + A = A
(b) A A = A

• T7 : Absorption (Redundance) Law

(a) A + A B = A
(b) A (A + B) = A

34
 Boolean Algebra

• T8 : Complementary Law
(a) X+X’=1
(b) X.X’=0

• T9 : Involution
(a) x’’ = x

35
De-Morgan’s Theorem

36
 De-Morgan’s first theorem

It states that the complement of sum is equal to the product of

their individual complements.

37
De-Morgan’s second theorem
It states that the complement of product is equal to the sum of their individual
complements.

38
Thank You!

39