Logic Circuits and

Switching Theory
By: John Neil F. Romasanta
Logic Circuits and Switching Theory

Theory of circuits made up of ideal

digital devices, including their
structure, behaviour, and design. It
incorporates Boolean logic (see 
Boolean algebra), a basic component
of modern digital switching systems.
Topics:
Number System Logic Gate Circuit
 Review of Number System  Output (Basic Logic Gates)
 Conversion of Number  Truth Table
System
Universal Gate
Basic Logic Gates  Nand Gate
 Inverter/ Not Gate  Nor Gate
 And Gate
 Or Gate De Morgan’s Theorem

Boolean Algebra
Number System
Number System

The number system or the numeral

system is the system of naming or
representing numbers.
Common Number System
Decimal Number System
Binary Number System
Octal Number System
Hexadecimal Number System
Conversion of Number System
Binary Hexadecimal
 Binary to Decimal  Hexadecimal to Binary
 Binary to Octal  Hexadecimal to Octal
 Binary to Hexadecimal  Hexadecimal to Decimal
Octal Decimal
 Octal to Binary  Decimal to Binary
 Octal to Decimal  Decimal to Octal
 Octal to Hexadecimal  Decimal to Hexadecimal
Conversion of
Number System
Binary to Decimal
EXAMPLE: Binary to Decimal

1100111010₂ 826 ₁₀
1 1 0 0 1 1 1 0 1 0

2⁹ 2⁸ 2⁷ 2⁶ 2⁵ 2⁴ 2³ 2² 2¹ 2⁰

512 256 128 64 32 16 8 4 2 1

512 + 256 + 0 + 0 + 32 + 16 + 8 + 0 + 2 + 0

Ans. 826₁₀
EXAMPLE: Binary to Decimal

11010.01101₂ 26.328125
₁₀
1 1 0 1 0. 0 1 1 0 1

2⁴ 2³ 2² 2¹ 2⁰ 2­ˉ¹ 2­ˉ² 2­ˉ³ 2­ˉ⁴ 2­

ˉ⁵
16 8 4 2 1 ½ ¼ 1/16 1/32 1/64

16 + 8 + 0 + 2 + 0 + 0 + 1/4 + 1/16 + 0 + 1/64

Ans. 26.328125₁₀
PRACTICE: Binary to Decimal

1.) 10101101₂ 173

10

2.) 1010.11101₂ 10.84375 10

Binary to Octal
Example: Binary to Octal

1100111010₂ 1472
8

0 0 1 1 0 0 1 1 1 0 1 0

4 2 1 4 2 1 4 2 1 4 2 1

1 4 7 2

Ans. 1472₈
Practice: Binary to Octal

1. 1101110101₂ 1565
8

2. 10111110101₂ 2765
8
Binary to Hexadecimal
Example: Binary to Hexadecimal

11111010100111₂ 3EA7
16

0 0 1 1 1 1 1 0 1 0 10 0 1 1 1

8 4 2 1 8 4 2 1 8 4 2 1 8 4 2 1

A-10
B-11
3 E A 7
C-12
D-13
E-14 Ans. 3EA7₁₆
F-15
Practice: Binary to Hexadecimal

1. 1101110101101₂ 1BAD
16

2. 1011011110101₂ 16F5
16
Octal to Binary
Example: Octal to Binary

110010111101011
62753₈
2
6 2 7 5 3

4 2 1 4 2 1 4 2 1 4 2 1 4 2 1

1 1 0 0 1 0 1 1 1 1 0 1 0 1 1

Ans. 110010111101011₂
Practice: Octal to Binary

1. 75341₈ 111101011100001

1110000011011
2. 16033₈ 2
Octal to Decimal
Example: Octal to Decimal

62753₈ 26091
10
6 2 7 5 3

8⁴ 8³ 8² 8¹ 8⁰

6 X 8⁴ 2 x 8³ 7 X 8² 5 X 8¹ 3 X 8⁰

Ans. 26091₁₀
Practice: Octal to Decimal

1. 75341₈ 31457
10

2. 16033₈ 7195
10
Octal to Hexadecimal
Example: Octal to Hexadecimal

62753₈ 65EB
16
Octal to Binary 6 2 7 5 3

110 010 111 101 011

110 0101 1110 1011₂ Hexadecimal

A-10
0110 0101 1110 1011
B-11
C-12
D-13
E-14
F-15
6 5 E B Ans. 65EB₁₆
Practice: Octal to Hexadecimal

1. 75341₈ 7AE1
16

2. 16033₈ 1C1B
16
Hexadecimal to Binary
Example: Hexadecimal to Binary

11101110000101000011
EE143₁₆
2

Octal to Binary E E 1 4 3
8421

A-10
B-11 1110 1110 0001 0100 0011
C-12
D-13
E-14
F-15

Ans. 11101110000101000011₂
Practice: Hexadecimal to Binary

1. BAD1₁₆ 1011101011010001
2

1110011100100
2. 1CE4₁₆ 2
Hexadecimal to Octal
Example: Hexadecimal to Octal

E7A6C₁₆ 3475154
Hexadecimal to Binary 8
8421 E 7 A 6 C

1110 0111 1010 0110 1100

011 100 111 101 001 101 100₂ Octal 421

011 100 111 101 001 101 100

A-10
B-11
C-12
D-13
E-14 3 4 7 5 1 5 4
F-15 Ans. 3475154₈
Practice: Hexadecimal to Octal

1. A2C5E₁₆ 2426136
8

2. B7A6D₁₆ 2675155
8
Hexadecimal to Decimal
Example: Octal to Hexadecimal

EE143₁₆ 975171
10

E E 1 4 3

14x 16⁴ 14 x 16³ 1 X 16² 4 X 16¹ 3 X 16⁰

917504 57344 256 64 3

Ans. 975171₁₀
Practice: Hexadecimal to Decimal

1. BAD1₁₆ 47825
10

7396
2. 1CE4₁₆ 10
Basic Logic Gates
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.
NOT GATE / INVERTER
 The NOT gate is an electronic circuit that
produces an inverted version of the input at
its output. It is also known as an inverter.
OR GATE
 An OR gate is a digital logic gate with two or more inputs and one
output that performs logical disjunction. The output of an OR gate is
true when one or more of its inputs are true. If all of an OR
gate's inputs are false, then the output of the OR gate is false.
AND GATE
 An AND gate is a digital logic gate with two or more inputs and one
output that performs logical conjunction. The output of an AND gate is
true only when all of the inputs are true. If one or more of an AND
gate's inputs are false, then the output of the AND gate is false.
A+B

(A+B)(C+D)

C+D
SAMPLE PROBLEM

A B C ABC+A(B+C)
0 0 0 0
ABC ABC+A(B+C)
0 0 1 0
0 1 0 0
A 0 1 1 0
B 1 0 0 1
A(B+C) 1 0 1 1
1 1 0 1
B+C
C 1 1 1 1
Universal Logic Gates
Universal Logic Gate

A universal gate is a gate which can

implement any Boolean function without
need to use any other gate type.

The NAND and NOR gates are

universal gates.
NAND GATE
 In digital electronics, a NAND gate (NOT-
AND) is a logic gate which produces an
output which is false only if all its inputs are
true
NOR GATE
 The inclusive NOR (Not-OR) gate has
an output that is normally at logic level “1” and only
goes “LOW” to logic level “0” when ANY of its inputs
are at logic level “1”.
A B C D (A+B)(Ĉ)(C+D)
SAMPLE PROBLEM
0 0 0 0 0
0 0 0 1 1
0 0 1 0 0
A+B 0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
(A+B)(C)(C+D) 0 1 1 0 0
C
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
C+D 1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0
De Morgan’s Theorem
De Morgan’s Theorem
 DeMorgan’s Theorem is mainly used to
solve the various Boolean algebra
expressions.

 The Demorgan’s theorem defines the

uniformity between the gate with same
inverted input and output.

 It is used for implementing the basic gate

operation likes NAND gate and NOR gate. 
Example: Using De Morgan’s Theorem

Given

(A+C)(B+D)
(A+C)+(B+D)
(AC)+(BD)
AC+BD
Example: Using De Morgan’s Theorem

Given

AB+C
AB(C)
AB(C)
ABC
BOOLEAN ALGEBRA
Simplify the following Boolean equations

1. (A+B)(AB)
2. (A+B)(A+B)
3. BC+ABC+BC

4. A(B+C)+A+B

5. A+AB+AB+A+B
Thank You
and
Goodluck !