Lecture-2

Digital Electronics
(ITIT1201)

Dr. Nalin Kumar Sharma

Deptt. of Electronics and Electrical Engineering

1
Objectives of this Lecture
• Intuitions of bits.
• Number systems

2
Digital Signal and Switches
• Digital Signals have finite number of levels in amplitude.

• Suppose in a voltmeter (0 to 10V), we want to have to levels, i.e.,

Level-1 0-5 V
Level-2 5-10 V
• Can I represent these with an electric switch?

3
More Level, More Switches….
• If we have n number of switches, we can represent of levels.

• When number of levels (states) increases,

• Accuracy increases
• More switches are required

4
Bits are switches
• Each switch as a bit represents power of 2.

• A RAM is a collection of tiny switches (Actually, a lot of switches!!!)

• How many levels a 16 GB can have?

5
Number System
• Number: A set of value used to represent a quantity.

• O and 1 are binary number system.

• Base: How many distinct digits a number has?

6
Number System
Name Base ( r ) Different digits ( 0 to r-1)
Binary 2
Octal 8
Decimal 10
Hexadecimal 16

7
Decimal system
• 645

8
Conversion from one number system to
another

9
Fun activity
• https://www.albany.edu/faculty/jmower/geog/gog530Python/src/
BitSwitchesAsNumbers3.htm

10
Introduction to Boolean Algebra
• Boolean algebra is the branch of algebra that
deals with logical operations and binary variables.
• It is an algebraic system consisting of 0,1 and
binary operators (0 and 1 can be considered as
false and true).
• It is used to analyze and simplify digital circuits or
digital gates.
George Boole, 1880s

11
Terminology
• Boolean Variables: A Boolean variable is defined as a variable or a
symbol, generally an alphabet that represents the logical quantities
such as 0 or 1.

• Truth Table: The truth table is a table that gives all the possible values
of logical variables and the combination of the variables. 

• Basic operators/ Boolean Postulates: OR, AND, NOT

12
Basic operations of Boolean algebra
• Compliment or Negation or Not operation

0 1
1 0

13
Basic operations of Boolean algebra
• AND operation
B Y
0 0 0
0 1 0
1 0 0
1 1 1

14
Property of AND operator
1. A.A = A 
2. A.0 = 0 
3. A.1 = A
4. A.A’ = 0 

15
Basic operations of Boolean algebra
• OR operation
B Y
0 0 0
0 1 1
1 0 1
1 1 1

16
Commutative Property/ Law
• A variable order does not matter in OR and AND operation, i.e., 

17
Associative Property/ Law
• The order of operation does not matter if the priority of variables are
the same

18
Distributive Property
• This law governs the opening up of brackets, i.e., 

1. A.(B+C) = (A.B)+(A.C)

2. (A+B)(A+C) = A + BC 

19
Absorption law
• This law involved absorbing similar variables, i.e., 

1. A.(A+B) = A 
2. A + AB = A
3. A+ A'B = A+B
4. A(A' + B) = AB

20
Consensus theorem: 
• AB + A'C + BC = AB + A'C

21
De Morgan law
The operation of an AND or OR logic circuit is unchanged if all inputs
are inverted, the operator is changed from AND to OR, and the output
is inverted, i.e., 

1. (A.B)' = A' + B’ 

2. (A+B)' = A'.B'

22
References
• https://www.geeksforgeeks.org/properties-of-boolean-algebra/
• https://www.allaboutcircuits.com/textbook/digital/chpt-7/boolean-al
gebraic-properties/
• https://pijaeducation.com/basic-electronics/electronic-components-a
nd-circuits/section-c/logic-gates-using-switch/

23