The document discusses digital electronics topics including number systems, binary logic functions, and Boolean algebra. It covers converting between decimal, binary, octal, and hexadecimal number systems using long division. Examples are provided to illustrate converting decimal numbers to other bases, such as converting 29 to binary and 105 to hexadecimal. Boolean logic topics like logic gates and De Morgan's theorems are also listed in the overview.
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
Digital electronics number system gates and boolean theorem
1. Digital Electronics
Number System, Logic Gates and Boolean Theorems
Dr. Nilesh Bhaskarrao Bahadure
nbahadure@gmail.com
https://www.sites.google.com/site/nileshbbahadure/home
June 30, 2021
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 1 / 74
2. Overview
1 Binary logic functions
2 Number System Conversion
Conversion for fractional part
3 Other base number system to Decimal
Binary to Decimal Conversion
Convert Binary fraction to Decimal
4 Laws of Boolean Algebra
5 De Morgan’s Theorem
6 Logic Gates
7 Examples
8 Thank You
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 2 / 74
4. Syllabus
Binary logic functions, Boolean laws, truth tables, associative and
distributive properties, DeMorgans theorems, realization of switching
functions using logic gates
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 3 / 74
6. binary logic functions
Binary logic consists of binary variables and logical operations. The
variables are designated by the alphabets such as A, B, C, x, y, z, etc.,
with each variable having only two distinct values: 1 and 0. ... Logic gates
are the basic elements that make up a digital system.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 4 / 74
7. Number System
Figure : Number System
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 5 / 74
8. Decimal Number System
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 6 / 74
9. Decimal Number System
The number system that we use in our day-to-day life is the decimal
number system. Decimal number system has base 10 as it uses 10 digits
from 0 to 9. In decimal number system, the successive positions to the left
of the decimal point represents units, tens, hundreds, thousands and so on.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 6 / 74
10. Decimal Number System
The number system that we use in our day-to-day life is the decimal
number system. Decimal number system has base 10 as it uses 10 digits
from 0 to 9. In decimal number system, the successive positions to the left
of the decimal point represents units, tens, hundreds, thousands and so on.
Each position represents a specific power of the base (10). For example,
the decimal number 1234 consists of the digit 4 in the units position, 3 in
the tens position, 2 in the hundreds position, and 1 in the thousands
position, and its value can be written as
(1 ∗ 1000) + (2 ∗ 100) + (3 ∗ 10) + (4 ∗ 1)
(1*103) + (2 ∗ 102) + (3 ∗ 101) + (4 ∗ 100)
1000 + 200 + 30 + 1
1234
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 6 / 74
11. Binary Number System
Characteristics
1 Uses two digits, 0 and 1.
2 Also called base 2 number system
3 Each position in a binary number represents a 0 power of the base
(2). Example: 20
4 Last position in a binary number represents an x power of the base
(2). Example: 2x where x represents the last position - 1.
Example
Binary Number: 10101
Calculating Decimal Equivalent –
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 7 / 74
12. Binary Number System...
Step Binary Number Decimal Number
Step 1 10101 ((1x24) + (0x23) + (1x22) + (0x21) + (1x20))10
Step 2 10101 (16 + 0 + 4 + 0 + 1)10
Step 3 10101 2110
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 8 / 74
13. Octal Number System
Characteristics
1 Uses eight digits, 0,1,2,3,4,5,6,7.
2 Also called base 8 number system
3 Each position in an octal number represents a 0 power of the base
(8). Example: 80
4 Last position in an octal number represents an x power of the base
(8). Example: 8x where x represents the last position - 1.
Example
Octal Number – 12570
Calculating Decimal Equivalent –
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 9 / 74
14. Octal Number System...
Step Octal Number Decimal Number
Step 1 12570 ((1x84) + (2x83) + (5x82) + (7x81) + (0x80))10
Step 2 12570 (4096 + 1024 + 320 + 56 + 0)10
Step 3 12570 549610
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 10 / 74
15. Octal Number System...
Octal Number Binary Number
0 000
1 001
2 010
3 011
4 100
5 101
6 110
7 111
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 11 / 74
16. Hexadecimal Number System
Characteristics
1 Uses 10 digits and 6 letters, 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F.
2 Letters represents numbers starting from 10. A = 10, B = 11, C =
12, D = 13, E = 14, F = 15.
3 Also called base 16 number system.
4 Each position in a hexadecimal number represents a 0 power of the
base (16). Example 160.
5 Last position in a hexadecimal number represents an x power of the
base (16). Example 16x where x represents the last position - 1.
Example
Hexadecimal Number: 19FDE
Calculating Decimal Equivalent –
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 12 / 74
18. Hexadecimal Number System...
Binary Number Hex. Number
0000 0
0001 1
0010 2
0011 3
0100 4
0101 5
0110 6
0111 7
1000 8
1001 9
1010 A
1011 B
1100 C
1101 D
1110 E
1111 F
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 14 / 74
19. Number System Conversion
There are many methods or techniques which can be used to convert
numbers from one base to another.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 15 / 74
20. Decimal to Other Base System
1 Step 1 - Divide the decimal number to be converted by the value of
the new base.
2 Step 2 - Get the remainder from Step 1 as the rightmost digit (least
significant digit) of new base number.
3 Step 3 - Divide the quotient of the previous divide by the new base.
4 Step 4 - Record the remainder from Step 3 as the next digit (to the
left) of the new base number.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 16 / 74
21. Decimal to Other Base System
1 Step 1 - Divide the decimal number to be converted by the value of
the new base.
2 Step 2 - Get the remainder from Step 1 as the rightmost digit (least
significant digit) of new base number.
3 Step 3 - Divide the quotient of the previous divide by the new base.
4 Step 4 - Record the remainder from Step 3 as the next digit (to the
left) of the new base number.
Repeat Steps 3 and 4, getting remainders from right to left, until the
quotient becomes zero in Step 3.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 16 / 74
22. Decimal to Other Base System
1 Step 1 - Divide the decimal number to be converted by the value of
the new base.
2 Step 2 - Get the remainder from Step 1 as the rightmost digit (least
significant digit) of new base number.
3 Step 3 - Divide the quotient of the previous divide by the new base.
4 Step 4 - Record the remainder from Step 3 as the next digit (to the
left) of the new base number.
Repeat Steps 3 and 4, getting remainders from right to left, until the
quotient becomes zero in Step 3.
The last remainder thus obtained will be the Most Significant Digit (MSD)
of the new base number.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 16 / 74
24. Example
Convert decimal number 29 to binary
Step Operation Result Remainder
Step 1 29 / 2 14 1
Step 2 14 / 2 7 0
Step 3 7 / 2 3 1
Step 4 3 / 2 1 1
Step 5 1 / 2 0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 17 / 74
25. Example
Convert decimal number 29 to binary
Step Operation Result Remainder
Step 1 29 / 2 14 1
Step 2 14 / 2 7 0
Step 3 7 / 2 3 1
Step 4 3 / 2 1 1
Step 5 1 / 2 0 1
As mentioned in Steps 2 and 4, the remainders have to be arranged in the
reverse order so that the first remainder becomes the Least Significant
Digit (LSD) and the last remainder becomes the Most Significant Digit
(MSD).
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 17 / 74
26. Example
Convert decimal number 29 to binary
Step Operation Result Remainder
Step 1 29 / 2 14 1
Step 2 14 / 2 7 0
Step 3 7 / 2 3 1
Step 4 3 / 2 1 1
Step 5 1 / 2 0 1
As mentioned in Steps 2 and 4, the remainders have to be arranged in the
reverse order so that the first remainder becomes the Least Significant
Digit (LSD) and the last remainder becomes the Most Significant Digit
(MSD).
Decimal Number (29)10 = Binary Number (11101)2
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 17 / 74
28. Example
Convert decimal number 210 to Octal
Step Operation Result Remainder
Step 1 210 / 8 26 2
Step 2 26 / 8 3 2
Step 3 3 / 8 0 3
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 18 / 74
29. Example
Convert decimal number 210 to Octal
Step Operation Result Remainder
Step 1 210 / 8 26 2
Step 2 26 / 8 3 2
Step 3 3 / 8 0 3
Now, write remainder from bottom to up (in reverse order), this will be
322 which is equivalent octal number of decimal integer 210.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 18 / 74
30. Example
Convert decimal number 210 to Octal
Step Operation Result Remainder
Step 1 210 / 8 26 2
Step 2 26 / 8 3 2
Step 3 3 / 8 0 3
Now, write remainder from bottom to up (in reverse order), this will be
322 which is equivalent octal number of decimal integer 210.
Decimal Number (210)10 = Octal Number (322)8
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 18 / 74
32. Example
Convert decimal number 105 to Hexadecimal
Step Operation Result Remainder
Step 1 105 / 16 6 9
Step 2 6 / 16 0 6
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 19 / 74
33. Example
Convert decimal number 105 to Hexadecimal
Step Operation Result Remainder
Step 1 105 / 16 6 9
Step 2 6 / 16 0 6
Now, write remainder from bottom to up (in reverse order), this will be 69
which is equivalent hexadecimal number of decimal integer 105.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 19 / 74
34. Example
Convert decimal number 105 to Hexadecimal
Step Operation Result Remainder
Step 1 105 / 16 6 9
Step 2 6 / 16 0 6
Now, write remainder from bottom to up (in reverse order), this will be 69
which is equivalent hexadecimal number of decimal integer 105.
Decimal Number (105)10 = Hexadecimal Number (69)16
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 19 / 74
36. Example
Convert decimal number 540 into hexadecimal number.
Step Operation Result Remainder
Step 1 540 / 16 33 12 = C
Step 2 33 / 16 2 1
Step 3 2 / 16 0 2
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 20 / 74
37. Example
Convert decimal number 540 into hexadecimal number.
Step Operation Result Remainder
Step 1 540 / 16 33 12 = C
Step 2 33 / 16 2 1
Step 3 2 / 16 0 2
Now, write remainder from bottom to up (in reverse order), this will be
21C which is equivalent hexadecimal number of decimal integer 540.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 20 / 74
38. Example
Convert decimal number 540 into hexadecimal number.
Step Operation Result Remainder
Step 1 540 / 16 33 12 = C
Step 2 33 / 16 2 1
Step 3 2 / 16 0 2
Now, write remainder from bottom to up (in reverse order), this will be
21C which is equivalent hexadecimal number of decimal integer 540.
Decimal Number (540)10 = Hexadecimal Number (21C)16
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 20 / 74
39. Convert decimal fraction to other base number
1 Multiply the fractional decimal number by base value number.
2 Integral part of resultant decimal number will be first digit of fraction
base number.
3 Repeat step 1 using only fractional part of decimal number and then
step 2.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 21 / 74
40. Convert decimal fraction to binary number
1 Multiply the fractional decimal number by 2.
2 Integral part of resultant decimal number will be first digit of fraction
binary number.
3 Repeat step 1 using only fractional part of decimal number and then
step 2.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 22 / 74
42. Example
Convert decimal number 4.47 into binary number.
Part I: Conversion of Integer Part
Step Operation Result Remainder
Step 1 4 / 2 2 0
Step 2 2 / 2 1 0
Step 3 1 / 2 0 1
Part II: Conversion of Fractional Part
Step Operation Result Integer value
Step 1 0.47 * 2 0.94 0
Step 2 0.94 * 2 1.88 1
Step 3 0.88 * 2 1.76 1
Step 4 0.76 * 2 1.52 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 23 / 74
43. Example
Convert decimal number 4.47 into binary number.
Part I: Conversion of Integer Part
Step Operation Result Remainder
Step 1 4 / 2 2 0
Step 2 2 / 2 1 0
Step 3 1 / 2 0 1
Part II: Conversion of Fractional Part
Step Operation Result Integer value
Step 1 0.47 * 2 0.94 0
Step 2 0.94 * 2 1.88 1
Step 3 0.88 * 2 1.76 1
Step 4 0.76 * 2 1.52 1
Now, write remainder from bottom to up (in reverse order) this will be
100, collect integer parts from top to bottom in fractional part this will be
0111 by combining integer and fractional part the results will be.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 23 / 74
44. Example
Convert decimal number 4.47 into binary number.
Part I: Conversion of Integer Part
Step Operation Result Remainder
Step 1 4 / 2 2 0
Step 2 2 / 2 1 0
Step 3 1 / 2 0 1
Part II: Conversion of Fractional Part
Step Operation Result Integer value
Step 1 0.47 * 2 0.94 0
Step 2 0.94 * 2 1.88 1
Step 3 0.88 * 2 1.76 1
Step 4 0.76 * 2 1.52 1
Now, write remainder from bottom to up (in reverse order) this will be
100, collect integer parts from top to bottom in fractional part this will be
0111 by combining integer and fractional part the results will be.
Decimal Number (4.47)10 = Binary Number (100.0111)2
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 23 / 74
46. Example
Convert decimal fractional number 0.8125 into binary number.
Step Operation Result Integer value
Step 1 0.81252 x 2 1.625 1
Step 2 0.625 x 2 1.25 1
Step 3 0.25 x 2 0.50 0
Step 4 0.50 x 2 1.0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 24 / 74
47. Example
Convert decimal fractional number 0.8125 into binary number.
Step Operation Result Integer value
Step 1 0.81252 x 2 1.625 1
Step 2 0.625 x 2 1.25 1
Step 3 0.25 x 2 0.50 0
Step 4 0.50 x 2 1.0 1
Now, collect integer parts from top to bottom this will be 0.1101 so the
results will be.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 24 / 74
48. Example
Convert decimal fractional number 0.8125 into binary number.
Step Operation Result Integer value
Step 1 0.81252 x 2 1.625 1
Step 2 0.625 x 2 1.25 1
Step 3 0.25 x 2 0.50 0
Step 4 0.50 x 2 1.0 1
Now, collect integer parts from top to bottom this will be 0.1101 so the
results will be.
Decimal Number (0.81252)10 = Binary Number (0.1101)2
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 24 / 74
50. Example
Convert decimal fractional number 0.015625 into octal form.
Step Operation Result Integer value
Step 1 0.015625 x 8 0.125 0
Step 2 0.125 x 8 1.000 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 25 / 74
51. Example
Convert decimal fractional number 0.015625 into octal form.
Step Operation Result Integer value
Step 1 0.015625 x 8 0.125 0
Step 2 0.125 x 8 1.000 1
When we multiply 0.125 by 8 and take the integer part
0.125 x 8 = 1.000
Integer part = 1
Fractional part = 0
Now the fractional part is 0 so, we stop here.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 25 / 74
52. Example
Convert decimal fractional number 0.015625 into octal form.
Step Operation Result Integer value
Step 1 0.015625 x 8 0.125 0
Step 2 0.125 x 8 1.000 1
When we multiply 0.125 by 8 and take the integer part
0.125 x 8 = 1.000
Integer part = 1
Fractional part = 0
Now the fractional part is 0 so, we stop here.
Now, collect integer parts from top to bottom this will be 0.01 so the
results will be.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 25 / 74
53. Example
Convert decimal fractional number 0.015625 into octal form.
Step Operation Result Integer value
Step 1 0.015625 x 8 0.125 0
Step 2 0.125 x 8 1.000 1
When we multiply 0.125 by 8 and take the integer part
0.125 x 8 = 1.000
Integer part = 1
Fractional part = 0
Now the fractional part is 0 so, we stop here.
Now, collect integer parts from top to bottom this will be 0.01 so the
results will be.
Decimal Number (0.015625)10 = Octal Number (0.01)8
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 25 / 74
55. Example
Convert decimal number 7.16 into octal form
Part I: Conversion of Integer Part
Step Operation Result Remainder
Step 1 7 / 8 0 7
Part II: Conversion of Fractional Part
Step Operation Result Integer value
Step 1 0.16 x 8 1.28 1
Step 2 0.28 x 8 2.24 2
Step 3 0.24 x 8 1.92 1
Step 4 0.92 * 2 7.36 7
Step 4 0.36 * 2 2.88 2
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 26 / 74
56. Example
Convert decimal number 7.16 into octal form
Part I: Conversion of Integer Part
Step Operation Result Remainder
Step 1 7 / 8 0 7
Part II: Conversion of Fractional Part
Step Operation Result Integer value
Step 1 0.16 x 8 1.28 1
Step 2 0.28 x 8 2.24 2
Step 3 0.24 x 8 1.92 1
Step 4 0.92 * 2 7.36 7
Step 4 0.36 * 2 2.88 2
in this case, we have 5 digits as answer and the fractional part is still not 0
so, we stop here.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 26 / 74
57. Example
Convert decimal number 7.16 into octal form
Part I: Conversion of Integer Part
Step Operation Result Remainder
Step 1 7 / 8 0 7
Part II: Conversion of Fractional Part
Step Operation Result Integer value
Step 1 0.16 x 8 1.28 1
Step 2 0.28 x 8 2.24 2
Step 3 0.24 x 8 1.92 1
Step 4 0.92 * 2 7.36 7
Step 4 0.36 * 2 2.88 2
in this case, we have 5 digits as answer and the fractional part is still not 0
so, we stop here.
Decimal Number (7.16)10 = Octal Number (7.12172)8
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 26 / 74
59. Example
Convert decimal fractional number 0.06640625 into hexadecimal number.
Step Operation Result Integer value
Step 1 0.06640625 x 16 1.0625 1
Step 2 0.0625 x 16 1.0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 27 / 74
60. Example
Convert decimal fractional number 0.06640625 into hexadecimal number.
Step Operation Result Integer value
Step 1 0.06640625 x 16 1.0625 1
Step 2 0.0625 x 16 1.0 1
When we multiply 0.0625 by 16 and take the integer part
0.0625 x 16 = 1.0000
Integer part = 1
Fractional part = 0
Now the fractional part is 0 so, we stop here.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 27 / 74
61. Example
Convert decimal fractional number 0.06640625 into hexadecimal number.
Step Operation Result Integer value
Step 1 0.06640625 x 16 1.0625 1
Step 2 0.0625 x 16 1.0 1
When we multiply 0.0625 by 16 and take the integer part
0.0625 x 16 = 1.0000
Integer part = 1
Fractional part = 0
Now the fractional part is 0 so, we stop here.
Decimal Number (0.0625)10 = Hexadecimal Number (0.11)16
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 27 / 74
62. Binary to Decimal Conversion
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 28 / 74
63. Binary to Decimal Conversion
There are two methods to apply a binary to decimal conversion. The first
one uses positional representation of the binary. The second method is
called double dabble and is used for converting longer binary strings faster.
It doesn’t use the positions.
Method 1: Using Positions
1 Step 1: Write down the binary number.
2 Step 2: Starting with the least significant digit (LSB - the rightmost
one), multiply the digit by the value of the position. Continue doing
this until you reach the most significant digit (MSB - the leftmost
one).
3 Step 3: Add the results and you will get the decimal equivalent of the
given binary number.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 28 / 74
65. Example
Convert binary number 1010 into Decimal number.
Solution:
1 Step 1: Write down (1010)2 and determine the positions, namely the
powers of 2 that the digit belongs to.
2 Step 2: Represent the number in terms of its positions.
(1 ∗ 23) + (0 ∗ 22) + (1 ∗ 21) + (0 ∗ 20)
3 Step 3: (1 * 8) + (0 * 4) + (1 * 2) + (0 * 1) = 8 + 0 + 2 + 0 = 10
4 Therefore, (1010)2 = (10)10
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 29 / 74
66. Example
Convert binary number 1010 into Decimal number.
Solution:
1 Step 1: Write down (1010)2 and determine the positions, namely the
powers of 2 that the digit belongs to.
2 Step 2: Represent the number in terms of its positions.
(1 ∗ 23) + (0 ∗ 22) + (1 ∗ 21) + (0 ∗ 20)
3 Step 3: (1 * 8) + (0 * 4) + (1 * 2) + (0 * 1) = 8 + 0 + 2 + 0 = 10
4 Therefore, (1010)2 = (10)10
Binary Number (1010)2 = Decimal Number (10)10
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 29 / 74
67. Binary to Decimal Conversion
Method 2: Double Dabble
Also called doubling, this method is actually an algorithm that can be
applied to convert from any given base to decimal. Double dabble helps
converting longer binary strings in your head and the only thing to
remember is ’double the total and add the next digit’.
1 Step 1: Write down the binary number. Starting from the left, you
will be doubling the previous total and adding the current digit. In the
first step the previous total is always 0 because you are just starting.
Therefore, double the total (0 * 2 = 0) and add the leftmost digit.
2 Step 2: Double the total and add the next leftmost digit.
3 Step 3: Double the total and add the next leftmost digit. Repeat this
until you run out of digits.
4 Step 4: The result you get after adding the last digit to the previous
doubled total is the decimal equivalent.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 30 / 74
69. Example
Convert binary number 1010 into Decimal number.
Solution:
1 Step 1: Your previous total 0. Your leftmost digit is 1. Double the
total and add the leftmost digit (0 ∗ 2) + 1 = 1
2 Step 2: Double the previous total and add the next leftmost digit.
(1 ∗ 2) + 0 = 2
3 Step 3: Double the previous total and add the next leftmost digit.
(2 ∗ 2) + 1 = 5
4 Step 4: Double the previous total and add the next leftmost digit.
(5 ∗ 2) + 0 = 10
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 31 / 74
70. Example
Convert binary number 1010 into Decimal number.
Solution:
1 Step 1: Your previous total 0. Your leftmost digit is 1. Double the
total and add the leftmost digit (0 ∗ 2) + 1 = 1
2 Step 2: Double the previous total and add the next leftmost digit.
(1 ∗ 2) + 0 = 2
3 Step 3: Double the previous total and add the next leftmost digit.
(2 ∗ 2) + 1 = 5
4 Step 4: Double the previous total and add the next leftmost digit.
(5 ∗ 2) + 0 = 10
Binary Number (1010)2 = Decimal Number (10)10
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 31 / 74
87. Example
Convert binary number (101.1101)2 into Decimal number.
Step 1: Conversion of 101 to decimal
(1 ∗ 22
) + (0 ∗ 21
) + (1 ∗ 20
)
= (1 ∗ 4) + (0 ∗ 2) + (1 ∗ 1)
= (4 + 0 + 1) = 5
Step 2: Conversion of .1101 to decimal
0.1101 = (1 ∗ 2−1
) + (1 ∗ 2−2
) + (0 ∗ 2−3
) + (1 ∗ 2−4
)
0.1101 = (1/2 + 1/4 + 0/8 + 1/16)
0.1101 = (0.5 + 0.25 + 0 + 0.0625) = 0.8125
Step 3: Add result of step 1 and 2.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 37 / 74
88. Example
Convert binary number (101.1101)2 into Decimal number.
Step 1: Conversion of 101 to decimal
(1 ∗ 22
) + (0 ∗ 21
) + (1 ∗ 20
)
= (1 ∗ 4) + (0 ∗ 2) + (1 ∗ 1)
= (4 + 0 + 1) = 5
Step 2: Conversion of .1101 to decimal
0.1101 = (1 ∗ 2−1
) + (1 ∗ 2−2
) + (0 ∗ 2−3
) + (1 ∗ 2−4
)
0.1101 = (1/2 + 1/4 + 0/8 + 1/16)
0.1101 = (0.5 + 0.25 + 0 + 0.0625) = 0.8125
Step 3: Add result of step 1 and 2.
Binary Number (101.1101)2 = Decimal Number (5.8125)10
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 37 / 74
89. Laws of Boolean Algebra
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 38 / 74
90. Laws of Boolean Algebra
A set of rules or Laws of Boolean Algebra expressions have been invented
to help reduce the number of logic gates needed to perform a particular
logic operation resulting in a list of functions or theorems known
commonly as the Laws of Boolean Algebra.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 38 / 74
91. Laws of Boolean Algebra
A set of rules or Laws of Boolean Algebra expressions have been invented
to help reduce the number of logic gates needed to perform a particular
logic operation resulting in a list of functions or theorems known
commonly as the Laws of Boolean Algebra.
Boolean Algebra is the mathematics we use to analyse digital gates and
circuits. We can use these Laws of Boolean to both reduce and simplify a
complex Boolean expression in an attempt to reduce the number of logic
gates required. Boolean Algebra is therefore a system of mathematics
based on logic that has its own set of rules or laws which are used to
define and reduce Boolean expressions.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 38 / 74
92. Laws of Boolean Algebra
A set of rules or Laws of Boolean Algebra expressions have been invented
to help reduce the number of logic gates needed to perform a particular
logic operation resulting in a list of functions or theorems known
commonly as the Laws of Boolean Algebra.
Boolean Algebra is the mathematics we use to analyse digital gates and
circuits. We can use these Laws of Boolean to both reduce and simplify a
complex Boolean expression in an attempt to reduce the number of logic
gates required. Boolean Algebra is therefore a system of mathematics
based on logic that has its own set of rules or laws which are used to
define and reduce Boolean expressions.
The variables used in Boolean Algebra only have one of two possible
values, a logic ”0” and a logic ”1” but an expression can have an infinite
number of variables all labelled individually to represent inputs to the
expression, For example, variables A, B, C etc, giving us a logical
expression of A + B = C, but each variable can ONLY be a 0 or a 1.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 38 / 74
93. Laws of Boolean Algebra...
Annulment Law
A term AND’ed with a ”0” equals 0 or OR’ed with a ”1” will equal 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 39 / 74
94. Laws of Boolean Algebra...
Annulment Law
A term AND’ed with a ”0” equals 0 or OR’ed with a ”1” will equal 1
A . 0 = 0 A variable AND’ed with 0 is always equal to 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 39 / 74
95. Laws of Boolean Algebra...
Annulment Law
A term AND’ed with a ”0” equals 0 or OR’ed with a ”1” will equal 1
A . 0 = 0 A variable AND’ed with 0 is always equal to 0
A + 1 = 1 A variable OR’ed with 1 is always equal to 1
Identity Law
A term OR’ed with a ”0” or AND’ed with a ”1” will always equal that
term
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 39 / 74
96. Laws of Boolean Algebra...
Annulment Law
A term AND’ed with a ”0” equals 0 or OR’ed with a ”1” will equal 1
A . 0 = 0 A variable AND’ed with 0 is always equal to 0
A + 1 = 1 A variable OR’ed with 1 is always equal to 1
Identity Law
A term OR’ed with a ”0” or AND’ed with a ”1” will always equal that
term
A + 0 = A A variable OR’ed with 0 is always equal to the variable
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 39 / 74
97. Laws of Boolean Algebra...
Annulment Law
A term AND’ed with a ”0” equals 0 or OR’ed with a ”1” will equal 1
A . 0 = 0 A variable AND’ed with 0 is always equal to 0
A + 1 = 1 A variable OR’ed with 1 is always equal to 1
Identity Law
A term OR’ed with a ”0” or AND’ed with a ”1” will always equal that
term
A + 0 = A A variable OR’ed with 0 is always equal to the variable
A . 1 = A A variable AND’ed with 1 is always equal to the variable
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 39 / 74
98. Laws of Boolean Algebra...
Idempotent Law
An input that is AND’ed or OR’ed with itself is equal to that input
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 40 / 74
99. Laws of Boolean Algebra...
Idempotent Law
An input that is AND’ed or OR’ed with itself is equal to that input
A + A = A A variable OR’ed with itself is always equal to the variable
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 40 / 74
100. Laws of Boolean Algebra...
Idempotent Law
An input that is AND’ed or OR’ed with itself is equal to that input
A + A = A A variable OR’ed with itself is always equal to the variable
A . A = A A variable AND’ed with itself is always equal to the variable
Complement Law
A term AND’ed with its complement equals ”0” and a term OR’ed with
its complement equals ”1”
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 40 / 74
101. Laws of Boolean Algebra...
Idempotent Law
An input that is AND’ed or OR’ed with itself is equal to that input
A + A = A A variable OR’ed with itself is always equal to the variable
A . A = A A variable AND’ed with itself is always equal to the variable
Complement Law
A term AND’ed with its complement equals ”0” and a term OR’ed with
its complement equals ”1”
A.Ā = 0 A variable AND’ed with its complement is always equal to 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 40 / 74
102. Laws of Boolean Algebra...
Idempotent Law
An input that is AND’ed or OR’ed with itself is equal to that input
A + A = A A variable OR’ed with itself is always equal to the variable
A . A = A A variable AND’ed with itself is always equal to the variable
Complement Law
A term AND’ed with its complement equals ”0” and a term OR’ed with
its complement equals ”1”
A.Ā = 0 A variable AND’ed with its complement is always equal to 0
A + Ā = 1 A variable OR’ed with its complement is always equal to 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 40 / 74
103. Laws of Boolean Algebra...
Commutative Law
The order of application of two separate terms is not important
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 41 / 74
104. Laws of Boolean Algebra...
Commutative Law
The order of application of two separate terms is not important
A.B = B.A The order in which two variables are AND’ed makes no difference
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 41 / 74
105. Laws of Boolean Algebra...
Commutative Law
The order of application of two separate terms is not important
A.B = B.A The order in which two variables are AND’ed makes no difference
A+B = B+A The order in which two variables are OR’ed makes no difference
Double Negation Law
A term that is inverted twice is equal to the original term
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 41 / 74
106. Laws of Boolean Algebra...
Commutative Law
The order of application of two separate terms is not important
A.B = B.A The order in which two variables are AND’ed makes no difference
A+B = B+A The order in which two variables are OR’ed makes no difference
Double Negation Law
A term that is inverted twice is equal to the original term
¯
Ā = A A double complement of a variable is always equal to the variable
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 41 / 74
107. Laws of Boolean Algebra...
Associative Law
This law allows the removal of brackets from an expression and regrouping
of the variables
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 42 / 74
108. Laws of Boolean Algebra...
Associative Law
This law allows the removal of brackets from an expression and regrouping
of the variables
A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 42 / 74
109. Laws of Boolean Algebra...
Associative Law
This law allows the removal of brackets from an expression and regrouping
of the variables
A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
A(B.C) = (A.B)C = A . B . C (AND Associate Law)
Absorptive Law
This law enables a reduction in a complicated expression to a simpler one
by absorbing like terms.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 42 / 74
110. Laws of Boolean Algebra...
Associative Law
This law allows the removal of brackets from an expression and regrouping
of the variables
A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
A(B.C) = (A.B)C = A . B . C (AND Associate Law)
Absorptive Law
This law enables a reduction in a complicated expression to a simpler one
by absorbing like terms.
A + (A.B) = A (OR Absorption Law)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 42 / 74
111. Laws of Boolean Algebra...
Associative Law
This law allows the removal of brackets from an expression and regrouping
of the variables
A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
A(B.C) = (A.B)C = A . B . C (AND Associate Law)
Absorptive Law
This law enables a reduction in a complicated expression to a simpler one
by absorbing like terms.
A + (A.B) = A (OR Absorption Law)
A(A + B) = A (AND Absorption Law)
Distributive Law
This law permits the multiplying or factoring out of an expression.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 42 / 74
112. Laws of Boolean Algebra...
Associative Law
This law allows the removal of brackets from an expression and regrouping
of the variables
A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
A(B.C) = (A.B)C = A . B . C (AND Associate Law)
Absorptive Law
This law enables a reduction in a complicated expression to a simpler one
by absorbing like terms.
A + (A.B) = A (OR Absorption Law)
A(A + B) = A (AND Absorption Law)
Distributive Law
This law permits the multiplying or factoring out of an expression.
A(B + C) = A.B + A.C (OR Distributive Law)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 42 / 74
113. Laws of Boolean Algebra...
Associative Law
This law allows the removal of brackets from an expression and regrouping
of the variables
A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
A(B.C) = (A.B)C = A . B . C (AND Associate Law)
Absorptive Law
This law enables a reduction in a complicated expression to a simpler one
by absorbing like terms.
A + (A.B) = A (OR Absorption Law)
A(A + B) = A (AND Absorption Law)
Distributive Law
This law permits the multiplying or factoring out of an expression.
A(B + C) = A.B + A.C (OR Distributive Law)
A + (B.C) = (A + B).(A + C) (AND Distributive Law)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 42 / 74
114. De Morgan’s Theorem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 43 / 74
115. De Morgan’s Theorem
De Morgan has suggested two theorems which are extremely useful in
Boolean Algebra.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 43 / 74
116. De Morgan’s Theorem
De Morgan has suggested two theorems which are extremely useful in
Boolean Algebra.
De Morgan’s first theorem states that two (or more) variables NOR’ed
together is the same as the two variables inverted (Complement) and
AND’ed, while the second theorem states that two (or more) variables
NAND’ed together is the same as the two terms inverted (Complement)
and OR’ed.
Theorem 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 43 / 74
117. De Morgan’s Theorem
De Morgan has suggested two theorems which are extremely useful in
Boolean Algebra.
De Morgan’s first theorem states that two (or more) variables NOR’ed
together is the same as the two variables inverted (Complement) and
AND’ed, while the second theorem states that two (or more) variables
NAND’ed together is the same as the two terms inverted (Complement)
and OR’ed.
Theorem 1
AB = Ā + B̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 43 / 74
118. De Morgan’s Theorem
De Morgan has suggested two theorems which are extremely useful in
Boolean Algebra.
De Morgan’s first theorem states that two (or more) variables NOR’ed
together is the same as the two variables inverted (Complement) and
AND’ed, while the second theorem states that two (or more) variables
NAND’ed together is the same as the two terms inverted (Complement)
and OR’ed.
Theorem 1
AB = Ā + B̄
NAND gate = Bubbled OR
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 43 / 74
119. De Morgan’s Theorem
De Morgan has suggested two theorems which are extremely useful in
Boolean Algebra.
De Morgan’s first theorem states that two (or more) variables NOR’ed
together is the same as the two variables inverted (Complement) and
AND’ed, while the second theorem states that two (or more) variables
NAND’ed together is the same as the two terms inverted (Complement)
and OR’ed.
Theorem 1
AB = Ā + B̄
NAND gate = Bubbled OR
1 The left hand side (LHS) of this theorem represents a NAND gate
with inputs A and B, whereas the right hand side (RHS) of the
theorem represents an OR gate with inverted inputs.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 43 / 74
120. De Morgan’s Theorem
De Morgan has suggested two theorems which are extremely useful in
Boolean Algebra.
De Morgan’s first theorem states that two (or more) variables NOR’ed
together is the same as the two variables inverted (Complement) and
AND’ed, while the second theorem states that two (or more) variables
NAND’ed together is the same as the two terms inverted (Complement)
and OR’ed.
Theorem 1
AB = Ā + B̄
NAND gate = Bubbled OR
1 The left hand side (LHS) of this theorem represents a NAND gate
with inputs A and B, whereas the right hand side (RHS) of the
theorem represents an OR gate with inverted inputs.
2 This OR gate is called as Bubbled OR.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 43 / 74
121. De Morgan’s Theorem...
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 44 / 74
122. De Morgan’s Theorem...
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 45 / 74
123. De Morgan’s Theorem...
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 46 / 74
124. De Morgan’s Theorem...
Table 1 showing verification of the De Morgan’s first theorem
A B AB Ā B̄ Ā + B̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 46 / 74
125. De Morgan’s Theorem...
Table 1 showing verification of the De Morgan’s first theorem
A B AB Ā B̄ Ā + B̄
0 0 1 1 1 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 46 / 74
126. De Morgan’s Theorem...
Table 1 showing verification of the De Morgan’s first theorem
A B AB Ā B̄ Ā + B̄
0 0 1 1 1 1
0 1 1 1 0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 46 / 74
127. De Morgan’s Theorem...
Table 1 showing verification of the De Morgan’s first theorem
A B AB Ā B̄ Ā + B̄
0 0 1 1 1 1
0 1 1 1 0 1
1 0 1 0 1 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 46 / 74
128. De Morgan’s Theorem...
Table 1 showing verification of the De Morgan’s first theorem
A B AB Ā B̄ Ā + B̄
0 0 1 1 1 1
0 1 1 1 0 1
1 0 1 0 1 1
1 1 0 0 0 0
Table : Truth Table for De Morgan’s Theorem 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 46 / 74
129. De Morgan’s Theorem
Theorem 2
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 47 / 74
130. De Morgan’s Theorem
Theorem 2
A + B = Ā.B̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 47 / 74
131. De Morgan’s Theorem
Theorem 2
A + B = Ā.B̄
NOR gate = Bubbled AND
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 47 / 74
132. De Morgan’s Theorem
Theorem 2
A + B = Ā.B̄
NOR gate = Bubbled AND
1 The LHS of this theorem represents a NOR gate with inputs A and B,
whereas the RHS represents an AND gate with inverted inputs.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 47 / 74
133. De Morgan’s Theorem
Theorem 2
A + B = Ā.B̄
NOR gate = Bubbled AND
1 The LHS of this theorem represents a NOR gate with inputs A and B,
whereas the RHS represents an AND gate with inverted inputs.
2 This AND gate is called as Bubbled AND.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 47 / 74
134. De Morgan’s Theorem...
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 48 / 74
135. De Morgan’s Theorem...
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 49 / 74
136. De Morgan’s Theorem...
Table 2 showing verification of the De Morgan’s first theorem
A B A + B Ā B̄ Ā.B̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 49 / 74
137. De Morgan’s Theorem...
Table 2 showing verification of the De Morgan’s first theorem
A B A + B Ā B̄ Ā.B̄
0 0 1 1 1 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 49 / 74
138. De Morgan’s Theorem...
Table 2 showing verification of the De Morgan’s first theorem
A B A + B Ā B̄ Ā.B̄
0 0 1 1 1 1
0 1 0 1 0 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 49 / 74
139. De Morgan’s Theorem...
Table 2 showing verification of the De Morgan’s first theorem
A B A + B Ā B̄ Ā.B̄
0 0 1 1 1 1
0 1 0 1 0 0
1 0 0 0 1 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 49 / 74
140. De Morgan’s Theorem...
Table 2 showing verification of the De Morgan’s first theorem
A B A + B Ā B̄ Ā.B̄
0 0 1 1 1 1
0 1 0 1 0 0
1 0 0 0 1 0
1 1 0 0 0 0
Table : Truth Table for De Morgan’s Theorem 2
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 49 / 74
141. De Morgan’s Theorem...
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 50 / 74
142. Logic Gates
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 51 / 74
143. Logic Gates
Logic gates are the basic building blocks of any digital system. It is an
electronic circuit having one or more than one input and only one output.
The relationship between the input and the output is based on a certain
logic. Based on this, logic gates are named as AND gate, OR gate, NOT
gate etc.
AND Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 51 / 74
144. Logic Gates
Logic gates are the basic building blocks of any digital system. It is an
electronic circuit having one or more than one input and only one output.
The relationship between the input and the output is based on a certain
logic. Based on this, logic gates are named as AND gate, OR gate, NOT
gate etc.
AND Gate
A circuit which performs an AND operation is shown in figure. It has n
input (n >= 2) and one output.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 51 / 74
145. Logic Gates
Logic gates are the basic building blocks of any digital system. It is an
electronic circuit having one or more than one input and only one output.
The relationship between the input and the output is based on a certain
logic. Based on this, logic gates are named as AND gate, OR gate, NOT
gate etc.
AND Gate
A circuit which performs an AND operation is shown in figure. It has n
input (n >= 2) and one output.
Y = A AND B AND C....N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 51 / 74
146. Logic Gates
Logic gates are the basic building blocks of any digital system. It is an
electronic circuit having one or more than one input and only one output.
The relationship between the input and the output is based on a certain
logic. Based on this, logic gates are named as AND gate, OR gate, NOT
gate etc.
AND Gate
A circuit which performs an AND operation is shown in figure. It has n
input (n >= 2) and one output.
Y = A AND B AND C....N
Y = A.B.C....N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 51 / 74
147. Logic Gates
Logic gates are the basic building blocks of any digital system. It is an
electronic circuit having one or more than one input and only one output.
The relationship between the input and the output is based on a certain
logic. Based on this, logic gates are named as AND gate, OR gate, NOT
gate etc.
AND Gate
A circuit which performs an AND operation is shown in figure. It has n
input (n >= 2) and one output.
Y = A AND B AND C....N
Y = A.B.C....N
Y = ABC...N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 51 / 74
148. AND Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 52 / 74
149. AND Gate
AND gate logic diagram:
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 52 / 74
150. AND Gate
AND gate logic diagram:
Truth Table:
Inputs Output
A B AB
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 52 / 74
151. AND Gate
AND gate logic diagram:
Truth Table:
Inputs Output
A B AB
0 0 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 52 / 74
152. AND Gate
AND gate logic diagram:
Truth Table:
Inputs Output
A B AB
0 0 0
0 1 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 52 / 74
153. AND Gate
AND gate logic diagram:
Truth Table:
Inputs Output
A B AB
0 0 0
0 1 0
1 0 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 52 / 74
154. AND Gate
AND gate logic diagram:
Truth Table:
Inputs Output
A B AB
0 0 0
0 1 0
1 0 0
1 1 1
Table : Truth Table of AND Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 52 / 74
155. Logic Gates
OR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 53 / 74
156. Logic Gates
OR Gate
A circuit which performs an OR operation is shown in figure. It has n
input (n >= 2) and one output.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 53 / 74
157. Logic Gates
OR Gate
A circuit which performs an OR operation is shown in figure. It has n
input (n >= 2) and one output.
Y = A OR B OR C....N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 53 / 74
158. Logic Gates
OR Gate
A circuit which performs an OR operation is shown in figure. It has n
input (n >= 2) and one output.
Y = A OR B OR C....N
Y = A + B + C + ...N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 53 / 74
159. OR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 54 / 74
160. OR Gate
OR Gate logic diagram:
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 54 / 74
161. OR Gate
OR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 54 / 74
162. OR Gate
OR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
0 0 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 54 / 74
163. OR Gate
OR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
0 0 0
0 1 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 54 / 74
164. OR Gate
OR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
0 0 0
0 1 1
1 0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 54 / 74
165. OR Gate
OR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
0 0 0
0 1 1
1 0 1
1 1 1
Table : Truth Table of OR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 54 / 74
166. Logic Gates
NOT Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 55 / 74
167. Logic Gates
NOT Gate
NOT gate is also known as Inverter. It has one input A and one output Y.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 55 / 74
168. Logic Gates
NOT Gate
NOT gate is also known as Inverter. It has one input A and one output Y.
Y = NOT A
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 55 / 74
169. Logic Gates
NOT Gate
NOT gate is also known as Inverter. It has one input A and one output Y.
Y = NOT A
Y = Ā
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 55 / 74
170. NOT Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 56 / 74
171. NOT Gate
NOT Gate logic diagram:
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 56 / 74
172. NOT Gate
NOT Gate logic diagram:
Truth Table:
Inputs Output
A Y
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 56 / 74
173. NOT Gate
NOT Gate logic diagram:
Truth Table:
Inputs Output
A Y
0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 56 / 74
174. NOT Gate
NOT Gate logic diagram:
Truth Table:
Inputs Output
A Y
0 1
1 0
Table : Truth Table of NOT Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 56 / 74
175. Logic Gates
NAND Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 57 / 74
176. Logic Gates
NAND Gate
A NOT-AND operation is known as NAND operation. It has n input
(n >= 2) and one output.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 57 / 74
177. Logic Gates
NAND Gate
A NOT-AND operation is known as NAND operation. It has n input
(n >= 2) and one output.
Y = A NOT AND B NOT AND C....N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 57 / 74
178. Logic Gates
NAND Gate
A NOT-AND operation is known as NAND operation. It has n input
(n >= 2) and one output.
Y = A NOT AND B NOT AND C....N
Y = A NAND B NAND C +...N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 57 / 74
179. Logic Gates
NAND Gate
A NOT-AND operation is known as NAND operation. It has n input
(n >= 2) and one output.
Y = A NOT AND B NOT AND C....N
Y = A NAND B NAND C +...N
Y = A.B.C...N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 57 / 74
180. NAND Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 58 / 74
181. NAND Gate
NAND Gate logic diagram:
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 58 / 74
182. NAND Gate
NAND Gate logic diagram:
Truth Table:
Inputs Output
A B AB
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 58 / 74
183. NAND Gate
NAND Gate logic diagram:
Truth Table:
Inputs Output
A B AB
0 0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 58 / 74
184. NAND Gate
NAND Gate logic diagram:
Truth Table:
Inputs Output
A B AB
0 0 1
0 1 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 58 / 74
185. NAND Gate
NAND Gate logic diagram:
Truth Table:
Inputs Output
A B AB
0 0 1
0 1 1
1 0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 58 / 74
186. NAND Gate
NAND Gate logic diagram:
Truth Table:
Inputs Output
A B AB
0 0 1
0 1 1
1 0 1
1 1 0
Table : Truth Table of NAND Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 58 / 74
187. Logic Gates
NOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 59 / 74
188. Logic Gates
NOR Gate
A NOT-OR operation is known as NOR operation. It has n input
(n >= 2) and one output.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 59 / 74
189. Logic Gates
NOR Gate
A NOT-OR operation is known as NOR operation. It has n input
(n >= 2) and one output.
Y = A NOT OR B NOT OR C....N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 59 / 74
190. Logic Gates
NOR Gate
A NOT-OR operation is known as NOR operation. It has n input
(n >= 2) and one output.
Y = A NOT OR B NOT OR C....N
Y = A NOR B NOR C +...N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 59 / 74
191. Logic Gates
NOR Gate
A NOT-OR operation is known as NOR operation. It has n input
(n >= 2) and one output.
Y = A NOT OR B NOT OR C....N
Y = A NOR B NOR C +...N
Y = A + B + C + ...N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 59 / 74
192. NOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 60 / 74
193. NOR Gate
NOR Gate logic diagram:
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 60 / 74
194. NOR Gate
NOR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 60 / 74
195. NOR Gate
NOR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
0 0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 60 / 74
196. NOR Gate
NOR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
0 0 1
0 1 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 60 / 74
197. NOR Gate
NOR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
0 0 1
0 1 0
1 0 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 60 / 74
198. NOR Gate
NOR Gate logic diagram:
Truth Table:
Inputs Output
A B A + B
0 0 1
0 1 0
1 0 0
1 1 0
Table : Truth Table of NOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 60 / 74
199. Logic Gates
XOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 61 / 74
200. Logic Gates
XOR Gate
XOR or Ex-OR gate is a special type of gate. It can be used in the half
adder, full adder and subtractor. The exclusive-OR gate is abbreviated as
EX-OR gate or sometime as X-OR gate. It has n input (n >= 2) and one
output.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 61 / 74
201. Logic Gates
XOR Gate
XOR or Ex-OR gate is a special type of gate. It can be used in the half
adder, full adder and subtractor. The exclusive-OR gate is abbreviated as
EX-OR gate or sometime as X-OR gate. It has n input (n >= 2) and one
output.
Y = A XOR B XOR C....N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 61 / 74
202. Logic Gates
XOR Gate
XOR or Ex-OR gate is a special type of gate. It can be used in the half
adder, full adder and subtractor. The exclusive-OR gate is abbreviated as
EX-OR gate or sometime as X-OR gate. It has n input (n >= 2) and one
output.
Y = A XOR B XOR C....N
Y = A ⊕ B ⊕ C ⊕ ...N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 61 / 74
203. Logic Gates
XOR Gate
XOR or Ex-OR gate is a special type of gate. It can be used in the half
adder, full adder and subtractor. The exclusive-OR gate is abbreviated as
EX-OR gate or sometime as X-OR gate. It has n input (n >= 2) and one
output.
Y = A XOR B XOR C....N
Y = A ⊕ B ⊕ C ⊕ ...N
Y = AB̄ + ĀB
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 61 / 74
204. XOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 62 / 74
205. XOR Gate
XOR Gate logic diagram:
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 62 / 74
206. XOR Gate
XOR Gate logic diagram:
Truth Table:
Inputs Output
A B A ⊕ B
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 62 / 74
207. XOR Gate
XOR Gate logic diagram:
Truth Table:
Inputs Output
A B A ⊕ B
0 0 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 62 / 74
208. XOR Gate
XOR Gate logic diagram:
Truth Table:
Inputs Output
A B A ⊕ B
0 0 0
0 1 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 62 / 74
209. XOR Gate
XOR Gate logic diagram:
Truth Table:
Inputs Output
A B A ⊕ B
0 0 0
0 1 1
1 0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 62 / 74
210. XOR Gate
XOR Gate logic diagram:
Truth Table:
Inputs Output
A B A ⊕ B
0 0 0
0 1 1
1 0 1
1 1 0
Table : Truth Table of XOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 62 / 74
211. Logic Gates
XNOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 63 / 74
212. Logic Gates
XNOR Gate
XNOR gate is a special type of gate. It can be used in the half adder, full
adder and subtractor. The exclusive-NOR gate is abbreviated as EX-NOR
gate or sometime as X-NOR gate. It has n input (n >= 2) and one output.
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 63 / 74
213. Logic Gates
XNOR Gate
XNOR gate is a special type of gate. It can be used in the half adder, full
adder and subtractor. The exclusive-NOR gate is abbreviated as EX-NOR
gate or sometime as X-NOR gate. It has n input (n >= 2) and one output.
Y = A XNOR B XNOR C....N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 63 / 74
214. Logic Gates
XNOR Gate
XNOR gate is a special type of gate. It can be used in the half adder, full
adder and subtractor. The exclusive-NOR gate is abbreviated as EX-NOR
gate or sometime as X-NOR gate. It has n input (n >= 2) and one output.
Y = A XNOR B XNOR C....N
Y = A B C ...N
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 63 / 74
215. Logic Gates
XNOR Gate
XNOR gate is a special type of gate. It can be used in the half adder, full
adder and subtractor. The exclusive-NOR gate is abbreviated as EX-NOR
gate or sometime as X-NOR gate. It has n input (n >= 2) and one output.
Y = A XNOR B XNOR C....N
Y = A B C ...N
Y = AB + ĀB̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 63 / 74
216. XNOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 64 / 74
217. XNOR Gate
XNOR Gate logic diagram:
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 64 / 74
218. XNOR Gate
XNOR Gate logic diagram:
Truth Table:
Inputs Output
A B A B
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 64 / 74
219. XNOR Gate
XNOR Gate logic diagram:
Truth Table:
Inputs Output
A B A B
0 0 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 64 / 74
220. XNOR Gate
XNOR Gate logic diagram:
Truth Table:
Inputs Output
A B A B
0 0 1
0 1 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 64 / 74
221. XNOR Gate
XNOR Gate logic diagram:
Truth Table:
Inputs Output
A B A B
0 0 1
0 1 0
1 0 0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 64 / 74
222. XNOR Gate
XNOR Gate logic diagram:
Truth Table:
Inputs Output
A B A B
0 0 1
0 1 0
1 0 0
1 1 1
Table : Truth Table of XNOR Gate
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 64 / 74
223. Example - 1
Problem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 65 / 74
224. Example - 1
Problem
Simplify: C + BC
Solution
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 65 / 74
225. Example - 1
Problem
Simplify: C + BC
Solution
1 Step 1: DeMorgan’s Theore C + B̄ + C̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 65 / 74
226. Example - 1
Problem
Simplify: C + BC
Solution
1 Step 1: DeMorgan’s Theore C + B̄ + C̄
2 Step 2: Commutative, Associative Laws C + C̄ + B̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 65 / 74
227. Example - 1
Problem
Simplify: C + BC
Solution
1 Step 1: DeMorgan’s Theore C + B̄ + C̄
2 Step 2: Commutative, Associative Laws C + C̄ + B̄
3 Step 3: Complement Laws 1 + B̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 65 / 74
228. Example - 1
Problem
Simplify: C + BC
Solution
1 Step 1: DeMorgan’s Theore C + B̄ + C̄
2 Step 2: Commutative, Associative Laws C + C̄ + B̄
3 Step 3: Complement Laws 1 + B̄
4 Step 4: Annulment/Identity Law 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 65 / 74
229. Example - 1
Problem
Simplify: C + BC
Solution
1 Step 1: DeMorgan’s Theore C + B̄ + C̄
2 Step 2: Commutative, Associative Laws C + C̄ + B̄
3 Step 3: Complement Laws 1 + B̄
4 Step 4: Annulment/Identity Law 1
C + BC = 1
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 65 / 74
230. Example - 2
Problem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 66 / 74
231. Example - 2
Problem
Simplify: AB(Ā + B)(B̄ + B)
Solution
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 66 / 74
232. Example - 2
Problem
Simplify: AB(Ā + B)(B̄ + B)
Solution
1 Step 1: Identity Law (B + B̄ = 1), so the equation becomes
AB(Ā + B)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 66 / 74
233. Example - 2
Problem
Simplify: AB(Ā + B)(B̄ + B)
Solution
1 Step 1: Identity Law (B + B̄ = 1), so the equation becomes
AB(Ā + B)
2 Step 2: DeMorgan’s Theorem (Ā + B̄)(Ā + B)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 66 / 74
234. Example - 2
Problem
Simplify: AB(Ā + B)(B̄ + B)
Solution
1 Step 1: Identity Law (B + B̄ = 1), so the equation becomes
AB(Ā + B)
2 Step 2: DeMorgan’s Theorem (Ā + B̄)(Ā + B)
3 Step 3: Distributive law Ā.Ā + Ā.B + B̄.Ā + B̄.B
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 66 / 74
235. Example - 2
Problem
Simplify: AB(Ā + B)(B̄ + B)
Solution
1 Step 1: Identity Law (B + B̄ = 1), so the equation becomes
AB(Ā + B)
2 Step 2: DeMorgan’s Theorem (Ā + B̄)(Ā + B)
3 Step 3: Distributive law Ā.Ā + Ā.B + B̄.Ā + B̄.B
4 Step 4: Annulment/Identity Law Ā + Ā.B + B̄.Ā = Ā(1 + B + B̄)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 66 / 74
236. Example - 2
Problem
Simplify: AB(Ā + B)(B̄ + B)
Solution
1 Step 1: Identity Law (B + B̄ = 1), so the equation becomes
AB(Ā + B)
2 Step 2: DeMorgan’s Theorem (Ā + B̄)(Ā + B)
3 Step 3: Distributive law Ā.Ā + Ā.B + B̄.Ā + B̄.B
4 Step 4: Annulment/Identity Law Ā + Ā.B + B̄.Ā = Ā(1 + B + B̄)
5 Step 5: Complement/Identity Law Ā
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 66 / 74
237. Example - 2
Problem
Simplify: AB(Ā + B)(B̄ + B)
Solution
1 Step 1: Identity Law (B + B̄ = 1), so the equation becomes
AB(Ā + B)
2 Step 2: DeMorgan’s Theorem (Ā + B̄)(Ā + B)
3 Step 3: Distributive law Ā.Ā + Ā.B + B̄.Ā + B̄.B
4 Step 4: Annulment/Identity Law Ā + Ā.B + B̄.Ā = Ā(1 + B + B̄)
5 Step 5: Complement/Identity Law Ā
AB(Ā + B)(B̄ + B) = Ā
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 66 / 74
238. Example - 3
Problem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 67 / 74
239. Example - 3
Problem
Simplify: (A + C)(AD + AD̄) + AC + C
Solution
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 67 / 74
240. Example - 3
Problem
Simplify: (A + C)(AD + AD̄) + AC + C
Solution
1 Step 1: Distributive Law (A + C)A(D + D̄) + C(A + 1), so the
equation becomes
(A + C)A + C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 67 / 74
241. Example - 3
Problem
Simplify: (A + C)(AD + AD̄) + AC + C
Solution
1 Step 1: Distributive Law (A + C)A(D + D̄) + C(A + 1), so the
equation becomes
(A + C)A + C
2 Step 2: Distributive/Identity Law A.A + A.C + C = A + A.C + C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 67 / 74
242. Example - 3
Problem
Simplify: (A + C)(AD + AD̄) + AC + C
Solution
1 Step 1: Distributive Law (A + C)A(D + D̄) + C(A + 1), so the
equation becomes
(A + C)A + C
2 Step 2: Distributive/Identity Law A.A + A.C + C = A + A.C + C
3 Step 3: Distributive/Commutative law A(1 + C) + C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 67 / 74
243. Example - 3
Problem
Simplify: (A + C)(AD + AD̄) + AC + C
Solution
1 Step 1: Distributive Law (A + C)A(D + D̄) + C(A + 1), so the
equation becomes
(A + C)A + C
2 Step 2: Distributive/Identity Law A.A + A.C + C = A + A.C + C
3 Step 3: Distributive/Commutative law A(1 + C) + C
4 Step 4: Annulment/Identity Law A + C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 67 / 74
244. Example - 3
Problem
Simplify: (A + C)(AD + AD̄) + AC + C
Solution
1 Step 1: Distributive Law (A + C)A(D + D̄) + C(A + 1), so the
equation becomes
(A + C)A + C
2 Step 2: Distributive/Identity Law A.A + A.C + C = A + A.C + C
3 Step 3: Distributive/Commutative law A(1 + C) + C
4 Step 4: Annulment/Identity Law A + C
(A + C)(AD + AD̄) + AC + C = A + C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 67 / 74
245. Example - 4
Problem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
246. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
247. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
1 Step 1: Ā(A + B) + (B + A)(A + B̄)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
248. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
1 Step 1: Ā(A + B) + (B + A)(A + B̄)
2 Step 2: Ā.A + Ā.B + B.A + B.B̄ + A.A + A.B̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
249. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
1 Step 1: Ā(A + B) + (B + A)(A + B̄)
2 Step 2: Ā.A + Ā.B + B.A + B.B̄ + A.A + A.B̄
3 Step 3: Ā.B + B.A + A + A.B̄
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
250. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
1 Step 1: Ā(A + B) + (B + A)(A + B̄)
2 Step 2: Ā.A + Ā.B + B.A + B.B̄ + A.A + A.B̄
3 Step 3: Ā.B + B.A + A + A.B̄
4 Step 4: Ā.B + A(B + 1 + B̄)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
251. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
1 Step 1: Ā(A + B) + (B + A)(A + B̄)
2 Step 2: Ā.A + Ā.B + B.A + B.B̄ + A.A + A.B̄
3 Step 3: Ā.B + B.A + A + A.B̄
4 Step 4: Ā.B + A(B + 1 + B̄)
5 Step 5: Ā.B + A
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
252. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
1 Step 1: Ā(A + B) + (B + A)(A + B̄)
2 Step 2: Ā.A + Ā.B + B.A + B.B̄ + A.A + A.B̄
3 Step 3: Ā.B + B.A + A + A.B̄
4 Step 4: Ā.B + A(B + 1 + B̄)
5 Step 5: Ā.B + A
6 Step 6: (A + Ā)(A + B)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
253. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
1 Step 1: Ā(A + B) + (B + A)(A + B̄)
2 Step 2: Ā.A + Ā.B + B.A + B.B̄ + A.A + A.B̄
3 Step 3: Ā.B + B.A + A + A.B̄
4 Step 4: Ā.B + A(B + 1 + B̄)
5 Step 5: Ā.B + A
6 Step 6: (A + Ā)(A + B)
7 Step 7: (A + B)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
254. Example - 4
Problem
Simplify: Ā(A + B) + (B + AA)(A + B̄)
Solution
1 Step 1: Ā(A + B) + (B + A)(A + B̄)
2 Step 2: Ā.A + Ā.B + B.A + B.B̄ + A.A + A.B̄
3 Step 3: Ā.B + B.A + A + A.B̄
4 Step 4: Ā.B + A(B + 1 + B̄)
5 Step 5: Ā.B + A
6 Step 6: (A + Ā)(A + B)
7 Step 7: (A + B)
Ā(A + B) + (B + AA)(A + B̄) = (A + B)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 68 / 74
255. Example - 5
Problem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
256. Example - 5
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = A0B + BC0 + BC + AB0C0
Solution
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
257. Example - 5
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = A0B + BC0 + BC + AB0C0
Solution
1 Step 1: F(A, B, C) = A0B + B(C0 + C) + AB0C0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
258. Example - 5
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = A0B + BC0 + BC + AB0C0
Solution
1 Step 1: F(A, B, C) = A0B + B(C0 + C) + AB0C0
2 Step 2: F(A, B, C) = A0B + B + AB0C0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
259. Example - 5
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = A0B + BC0 + BC + AB0C0
Solution
1 Step 1: F(A, B, C) = A0B + B(C0 + C) + AB0C0
2 Step 2: F(A, B, C) = A0B + B + AB0C0
3 Step 3: F(A, B, C) = B(A0 + 1) + AB0C0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
260. Example - 5
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = A0B + BC0 + BC + AB0C0
Solution
1 Step 1: F(A, B, C) = A0B + B(C0 + C) + AB0C0
2 Step 2: F(A, B, C) = A0B + B + AB0C0
3 Step 3: F(A, B, C) = B(A0 + 1) + AB0C0
4 Step 4: F(A, B, C) = B + AB0C0
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
261. Example - 5
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = A0B + BC0 + BC + AB0C0
Solution
1 Step 1: F(A, B, C) = A0B + B(C0 + C) + AB0C0
2 Step 2: F(A, B, C) = A0B + B + AB0C0
3 Step 3: F(A, B, C) = B(A0 + 1) + AB0C0
4 Step 4: F(A, B, C) = B + AB0C0
5 Step 5: F(A, B, C) = (B + B̄)(B + AC̄)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
262. Example - 5
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = A0B + BC0 + BC + AB0C0
Solution
1 Step 1: F(A, B, C) = A0B + B(C0 + C) + AB0C0
2 Step 2: F(A, B, C) = A0B + B + AB0C0
3 Step 3: F(A, B, C) = B(A0 + 1) + AB0C0
4 Step 4: F(A, B, C) = B + AB0C0
5 Step 5: F(A, B, C) = (B + B̄)(B + AC̄)
6 Step 6: F(A, B, C) = (B + AC0)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
263. Example - 5
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = A0B + BC0 + BC + AB0C0
Solution
1 Step 1: F(A, B, C) = A0B + B(C0 + C) + AB0C0
2 Step 2: F(A, B, C) = A0B + B + AB0C0
3 Step 3: F(A, B, C) = B(A0 + 1) + AB0C0
4 Step 4: F(A, B, C) = B + AB0C0
5 Step 5: F(A, B, C) = (B + B̄)(B + AC̄)
6 Step 6: F(A, B, C) = (B + AC0)
F(A, B, C) = A0B + BC0 + BC + AB0C0 = (B + AC0)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 69 / 74
264. Example - 6
Problem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 70 / 74
265. Example - 6
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = (A + B)(A + C)
Solution
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 70 / 74
266. Example - 6
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = (A + B)(A + C)
Solution
1 Step 1: F(A, B, C) = A.A + A.C + B.A + B.C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 70 / 74
267. Example - 6
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = (A + B)(A + C)
Solution
1 Step 1: F(A, B, C) = A.A + A.C + B.A + B.C
2 Step 2: F(A, B, C) = A + A.C + B.A + B.C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 70 / 74
268. Example - 6
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = (A + B)(A + C)
Solution
1 Step 1: F(A, B, C) = A.A + A.C + B.A + B.C
2 Step 2: F(A, B, C) = A + A.C + B.A + B.C
3 Step 3: F(A, B, C) = A(1 + C + A) + B.C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 70 / 74
269. Example - 6
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = (A + B)(A + C)
Solution
1 Step 1: F(A, B, C) = A.A + A.C + B.A + B.C
2 Step 2: F(A, B, C) = A + A.C + B.A + B.C
3 Step 3: F(A, B, C) = A(1 + C + A) + B.C
4 Step 4: F(A, B, C) = A + B.C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 70 / 74
270. Example - 6
Problem
Minimize the following Boolean expression using Boolean identities –
F(A, B, C) = (A + B)(A + C)
Solution
1 Step 1: F(A, B, C) = A.A + A.C + B.A + B.C
2 Step 2: F(A, B, C) = A + A.C + B.A + B.C
3 Step 3: F(A, B, C) = A(1 + C + A) + B.C
4 Step 4: F(A, B, C) = A + B.C
F(A, B, C) = (A + B)(A + C) = A + B.C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 70 / 74
271. Example - 7
Problem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 71 / 74
272. Example - 7
Problem
Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
Solution
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 71 / 74
273. Example - 7
Problem
Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
Solution
1 Step 1:Apply the distributive law to the second and third terms in the expression, as
follows:
AB + AB + AC + BB + BC
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 71 / 74
274. Example - 7
Problem
Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
Solution
1 Step 1:Apply the distributive law to the second and third terms in the expression, as
follows:
AB + AB + AC + BB + BC
2 Step 2: (BB=B, AB+AB=AB)
AB + AC + B + BC
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 71 / 74
275. Example - 7
Problem
Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
Solution
1 Step 1:Apply the distributive law to the second and third terms in the expression, as
follows:
AB + AB + AC + BB + BC
2 Step 2: (BB=B, AB+AB=AB)
AB + AC + B + BC
3 Step 3: B(A + 1 + C) + AC
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 71 / 74
276. Example - 7
Problem
Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
Solution
1 Step 1:Apply the distributive law to the second and third terms in the expression, as
follows:
AB + AB + AC + BB + BC
2 Step 2: (BB=B, AB+AB=AB)
AB + AC + B + BC
3 Step 3: B(A + 1 + C) + AC
4 Step 4: B + AC
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 71 / 74
277. Example - 7
Problem
Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
Solution
1 Step 1:Apply the distributive law to the second and third terms in the expression, as
follows:
AB + AB + AC + BB + BC
2 Step 2: (BB=B, AB+AB=AB)
AB + AC + B + BC
3 Step 3: B(A + 1 + C) + AC
4 Step 4: B + AC
AB + A(B + C) + B(B + C) = B + AC
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 71 / 74
278. Example - 7
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 72 / 74
279. Example - 7
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 72 / 74
280. Example - 8
Problem
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 73 / 74
281. Example - 8
Problem
Simplify the Boolean expressions:
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 73 / 74
282. Example - 8
Problem
Simplify the Boolean expressions:
1 AB̄ + A(B + C) + B(B + C)
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 73 / 74
283. Example - 8
Problem
Simplify the Boolean expressions:
1 AB̄ + A(B + C) + B(B + C)
2 [AB̄(C + BD) + ĀB̄]C
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 73 / 74
284. Example - 8
Problem
Simplify the Boolean expressions:
1 AB̄ + A(B + C) + B(B + C)
2 [AB̄(C + BD) + ĀB̄]C
3 ĀBC + AB̄C̄ + ĀB̄C̄ + AB̄C + ABC
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 73 / 74
285. Thank you
Please send your feedback at nbahadure@gmail.com
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 74 / 74
286. Thank you
Please send your feedback at nbahadure@gmail.com
For download and more information Click Here
Dr. Nilesh Bhaskarrao Bahadure (Ph.D.) Digital Electronics June 30, 2021 74 / 74