Electronics Module g10 q2 Week 1 2

WHOLE BRAIN LEARNING SYSTEM
OUTCOME -BASED EDUCATION

Science, Technology and Engineering (STE) Program
GRADE
ELECTRONICS 10
QUARTER 2
LEARNING
MODULE WEEK 1-2
WBLS-OBE MELC-Aligned Self-Learning Module Electronics (Grade 10)

0
MODULE IN ELECTRONICS
Science, Technology and Engineering
(STE) Program
QUARTER II
WEEK 1-2
Digital Circuits
Development Team
Writer: Richard F. Aison
Editor: Ponciano S. Raspado
Reviewer: Hamilton C. Remigio
Management Team: Vilma D. Eda, CESO V
Joye D. Madalipay Arnel S. Bandiola
Juanito V. Labao Flenie A. Galicinao
What I Need to Know

1
This module in Electronics contains information and suggested learning activities
that provides you understanding on the knowledge, skills and desirable attitudes required in
assembling consumer electronic products and systems.
In order to benefit much from this module, you should learn the binary number
operation and identify different logic gates as well as logic IC. You should also be able to
learn on how diode and transistor is used as switch.
Most Essential Learning Competencies
1. Discuss Binary numbers operation
2. Identify different Logic gates
3. Discuss Logic IC
4. Discuss Diodes and transistors as switches
Learning Objectives:
1. Discuss Different Number System
2. Describe the action of logic gates.
- AND, OR, NAND, NOR, NOT, XOR and XNOR.
- Using truth tables.
3. Understand the use of universal gates.
- NAND.
- NOR.
4. Recognize common 74 series ICs containing standard logic gates.
5. Differentiate Diode and Transistor as Switches.
What I Know

2
Pre-Test
Directions: Convert the following numbers into its corresponding number system. Write your
answers with solution on a separate sheet of paper.
1. 6710 = __________2 6. 110012 = _________10
2. 011012 = _________10 7. 4110 = ___________2
3. 3610 = ________2 8. 111002 = _________10
4. 010112 = _________10 9. 1910 = ___________2
5. 8210 = ____________2 10. 1010102 = ________10
What’s In
Activity 1
JUMBLED WORDS
Direction: Arrange the jumbled words in a correct form. Write your answers on a separate
sheet of paper.
1. CIMALED -
2. NAIBYR -
3. ICEDLAMEXAH -
4. CILOG SATEG -
5. TRHUT EBLAT –
What’s New
Activity 2
CROSSWORD PUZZLE

3
Direction: Look for the words intended for the different number system. Write your answers
on a separate sheet of paper.
Q W E R T Y U I O P L K H
E H E X A D E C I M A L A
B V C X R E G H M V E R Y
D F G H O C T A L E D F H
Z C F G E I H X E R Y U K
A F R U B M I O B Y R C B
W V B I N A R Y E R H J I
P R E T Y L V C X V I O M
I O N H F D T E R T Y U I
What is It
Lesson
1 BINARY NUMBERS OPERATION
Within a computer, information is represented and

stored in a digital binary format. The term bit is an
abbreviation of binary digit and represents the smallest
piece of data. Humans interpret words and pictures;
computers interpret only patterns of bits.
A bit can have only two possible values, a one digit

(1) or a zero digit (0). A bit can be used to represent the
state of something that has two states. For example, a light
Figure 1. Binary Numbers 4
Source: ICT 7/8 Learning Module.pdf
switch can be either On or Off; in binary representation,
these states would correspond to 1 and 0, respectively.
Computers use binary codes to represent and interpret letters, numbers and special
characters with bits. A commonly used code is the American Standard Code for Information
Interchange (ASCII). With ASCII, each character is represented by a string of bits. For
example:
Capital letter: A = 01000001
Number: 9 = 00001001
Special character: # = 00100011
Each group of eight bits, such as the representations of letters and numbers, is known as a
byte. Codes can be used to represent almost any type of information digitally: computer data,
graphics, photos, voice, video, and music.
COMPARING BINARY AND DECIMAL NUMBERS
In the binary number system there are only two digits, 0 and 1. Binary number then,
are just string of 0s and 1s. In a moment we will see how to determine the decimal equivalent
of a binary number, such as 1001. How to count with binary numbers will be explained later
in this section.
All number systems have a base or radix, which specifies how many digits can be
used in each place count. For binary numbers, the base is 2, with 0 and 1 as the only two
digits. In the decimal system, the base is 10, so there are ten digits that can be used for each
place count. The digits are 0,1,2,3,4,5,6,7,8, and 99. The decimal number system id familiar
because it is used by all of us in our everyday world.
Each digit position in both the binary and decimal number system has a specified
weight in the value of the number. For binary numbers, the position represents a power of
2,4,8 and 16. For decimal numbers, each digit positon represents a power of 10, such as 100
and 1000.
The weight distribution for digit positions in the binary number system is illustrated in
Figure 2. Notice that the value, or weight, in each position doubles as we move left, because
the base is 2. We know that 2 0 = 1 is true, because any number raised to the zero power 1
equals 1. For the digit positions in the binary number 1001, the decimal value is 8 + 0 + 0 + 1
= 9. Notice that the procedure is to add only those bit positions that contain a 1 in the original
binary number.
27 26 25 24 23 22 21 20
128 64 32 16
Figure 2. Weight distribution for binary number system
8 4 2 1
Source: Grob Basic Electronics, 7th Edition
5
etc.
Typical binary numbers are often written in groups of four or eight digits. Example are
1001 and 10010110. Each digit, either 0 or 1, is referred a bit. A string of four bit is called a
nibble, and eight bits make a byte. Thus, 1001 is a nibble and 10010110 is a binary byte.
The weight distribution for digit places in the decimal system is shown in Figure 3.
Each positional value, or weight, increases by a factor of 10. Notice that as we move to the
left, the place values are 10, 100, 1000, 10,000, and 100,000. Consider 2367 as typical
decimal number. This value is determined as
2000 + 300 + 60 + 7 = 2367
105 104 103 102 101 100

etc.
100,000 10,000 1,000 100 10 1
Figure 3. Weight distribution for decimal number system

For either binary or decimal numbers, the digit at the right is referred to as the least
significant digit, or LSD, because its positional value, or weight, is the lowest. For the decimal
number 2367, the 7 is the LSD. In the binary number 1001, the 1 at right is the LSD.
The left-most digit is the most significant digit, or MSD, because its positional value,
or weight, is the highest. For the decimal number 2367 the 2 is the MSD with a value of
2000. In the binary number 1001, the 1 at the left is the MSD with the value of 8 in decimal
terms.
The method for counting with binary numbers is illustrated in Figure 4. Only four
places are shown here, but the same idea applies to more places, with the positional values
shown in Figure 2. For the numbers in the bottom row of Figure 4 the values are
(1111)2 = 8 + 4 + 2 + 1 = (15)10
Note that the subscripts indicate that 1111 is to base 2 (and therefore a binary
number), and 15 is to base 10 (so it’s a decimal number).
Positional Values
23 22 21 20
8 4 2 1 Decimal Count
0 0 0 0 =0+0+0+0=0
0 0 0 1 =0+0+0+1=1
0 0 1 0 =0+0+2+0=2
0 0 1 1 =0+0+2+1=3
0 1 0 0 =0+4+0+0=4
0 1 0 1 =0+4+0+1=5
0 1 1 0 =0+4+2+0=6
0 1 1 1 =0+4+2+1=7
1 0 0 0 =8+0+0+0=8
1 0 0 1 =8+0+0+1=9
1 0 1 0 = 8 + 0 + 2 + 0 = 10
1 0 1 1 = 8 + 0 + 2 + 1 = 11 6
1 1 0 0 = 8 + 4 + 0 + 0 = 12
1 1 0 1 = 8 + 4 + 0 + 1 = 13
1 1 1 0 = 8 + 4 + 2 + 0 = 14
1 1 1 1 = 8 + 4 + 2 + 1 = 15
Figure 4. Counting in the Binary System
DECIMAL TO BINARY CONVERSION
It may be desirable or necessary to convert a decimal number to its binary equivalent.

The method described here is called double-dabble, because it requires successive divisions
by 2. When converting a decimal number to its binary equivalent, be sure to write down each
quotient and its remainder, as shown for the example (decimal 27) in Figure 5. Firs, divide 27
by 2, which is 13 with a remainder of 1. This bit of 1 is the least significant bit (LSB) in the
resultant binary number. Next, divide the quotient of 14 by 2 to obtain a new quotient of 6
with a remainder of 1 again. This 1 is the next bit in the resultant binary number. Notice that
you read the bits upward in Figure 5.
Continue the process of dividing the new quotient by 2 and noting whether the
remainder is 0 or 1 until you have performed as many divisions as possible (i.e, until you
have obtained a quotient of 0 with a remainder of 1). The final remainder of 1 is the most
significant bit (MSB) in the binary equivalent number. Reading the remainders in Figure 5
from bottom to top we have 11011 as the binary equivalent of decimal 27. The values are 16
+ 8 + 0 + 2 + 1. Remember that when looking at the divisions and their remainders, the LSB
appears at the top and the MSB is at the bottom.
13
2 27 r=1 LSB
6
2 13 r=1
2 6 r=0 Read up
2 3 r=1
0
1 r=1 MSB
7
2
Figure 5. Double-dabble method of converting a decimal number to its binary
equivalent, using the remainders (r) of 0 or 1.
Checking: 1 1 0 1 1 multiplier
16 8 4 2 1 equivalents
16 8 0 2 1 results
16 + 8 + 2 + 1 = 27
DECIMAL TO OCTAL CONVERSION
The process of decimal-to-octal conversion is similar to that of decimal-to-binary

conversion. The progressive division in the case of the integer part and the progressive
multiplication while working on the fractional part here are by ‘8’ which is the radix of the octal
number system. Again, the integer and fractional parts of the decimal number are treated
separately. The process can be best illustrated with the help of an example.
Example 1.
We will find the octal equivalent of (73.75)10
Solution
• The integer part = 73
Divisor Dividend Remainder
8 73 —
8 9 1
8 1 1
— 0 1
• The octal equivalent of (73)10 = (111)8
• The fractional part = 0.75
• 0.75 × 8 = 0 with a carry of 6

8
• The octal equivalent of (0.75)10 = (.6)8
• Therefore, the octal equivalent of (73.75)10= (111.6)8
OCTAL NUMBER SYSTEM
The octal number system has a radix of 8 and therefore has eight distinct digits. All
higher-order numbers are expressed as a combination of these on the same pattern as the
one followed in the case of the binary and decimal number systems described in Sections
1.3 and 1.4. The independent digits are 0, 1, 2, 3, 4, 5, 6 and 7. The next 10 numbers that
follow ‘7’, for example, would be 10, 11, 12, 13, 14, 15, 16, 17, 20 and 21. In fact, if we omit
all the numbers containing the digits 8 or 9, or both, from the decimal number system, we
end up with an octal number system. The place values for the different digits in the octal
number system are 80,8 1,8 2 and so on (for the integer part) and 81,8 2, 83 and so on (for the
fractional part).
OCTAL TO DECIMAL CONVERSION
The decimal equivalent of the octal number (137.21)8 is determined as follows:
• The integer part = 137
• The decimal equivalent = 7 × 80 + 3 × 81 + 1 × 82 = 7 + 24 + 64 = 95
• The fractional part = .21
• The decimal equivalent = 2 × 8−1 + 1 × 8−2 = 0.265
• Therefore, the decimal equivalent of (137.21)8 = (95.265)10
HEXADECIMAL NUMBERS
Hexadecimal numbers are used extensively in the microcomputer field. As we will

see, binary numbers start to get very lenghthy and therefore become quite cumbersome to
work with. However, hexadecimal numbers, with a base of 16, are much shorter and,
therefore, much easier to work with. The first ten digits in the hexadecimal system are
represented by the number 0 through 9, and the letters A through F are used to represents
10, 11, 12, 13, 14 and 15 respectively.
As is true for binary and decimal numbers, each digit in the hexadecimal system has
a positional value or weight. For the right most digit, the positional value, or weight,
corresponds to 160 or 1, the next digit to the left corresponds to 16 1 or 16, and so on. Each
digit to the left has a positional value, or weight, that increases in ascending powers of 16.
The weight distribution for the hexadecimal number system is shown in Figure 6.

etc. 9
Figure 6. Weight distribution for hexadecimal number system

165 164 163 162 161 160
1,048,576 65,536 4096 256 16 1
Hexadecimal Counting Figure 7 shows the counting sequence. Start with 0 in the 160, or 1s,
column and proceed down until the digit “F” appears. Then, for the next count, the digit in the
1s column returns to 0, and the digit in the 16 1, or 16s, column advances by 1. This process
continues until the digits “FF” are reached. For the next count we start over with 0s in the 16 1
and 160 columns and add 1 to the 16 2 column.
Positional Values
163 162 161 160
4096 256 16 1 Decimal Count
0 =0
1 =1
2 =2
3 =3
4 =4
5 =5
6 =6
7 =7
8 =8
9 =9
A = 10
B = 11
C = 12
D = 13
E = 14
Figure 7. Counting in the Hexadecimal System
F Electronics,
Source: Grob Basic = 15 7th Edition
1 0 16 + 0 = 16
F F 240 + 15 = 255
1 0 0 256 + 0 + 0= 256
F F F 3840 + 240 + 15 = 4095

1 0 0 0 4096 + 0 + 0 + 0 = 4096
HEXADECIMAL TO DECIMAL CONVERSIONS
It is sometimes necessary or desirable to convert hexadecimal number to its decimal

equivalent. To convert hexadecimal number B49F16, for example, start by writing the
positional values, or weights, above each digit in the hexadecimal number:

10
163 162 161 160
B 4 9 F
Next, multiply each digit by its positional value and add them all together. The
resultant number is the decimal equivalent of the hexadecimal number. This can be shown
as
(11 x 4096) + (4 x 256) + (9 x 16) + (15 x 1)

45,056 + 1024 + 144 + 15 = 46,239
Thus, B49F16 = 46, 23010.

DECIMAL TO HEXADECIMAL CONVERSIONS
To convert from a decimal number to hexadecimal number, we can hex-dabble. The
idea is the same as double-dabble, but with hex-dabble we have successive divisions by 16
rather than 2. You know the process is complete when you obtain a quotient of 0 and a
remainder ranging anywhere from 1 to F. The example in Figure 8 illustrates how the hex-
dabble technique is used to obtain the hexadecimal equivalent of decimal number 666610.
The first step is to divide 6666 by 16 to obtain a quotient of 416 with a remainder of
10. Next, we divide the quotient of 416 by 16 to obtain a quotient of 26 with a remainder of 0.
Next 26 is divided by 16 to obtain a quotient of 1 with a remainder of 10. Finally, 1 is divided
by 16 to obtain a quotient of 0 with a remainder of 1. Therefore 6666 10 = 1A0A16. Notice that
the last indicated remainder is the MSD in the final answer, while the first remainder obtained
is the LSD. Notice also that when remainder of 10, 11, 12,13, 14, and 15 are obtained, we
substitute the equivalent hexadecimal digit (A, B, C, D, E and F, respectively) as the
remainder.
416
16 6666 r = 10 LSB
26
16 416 r=0
Read up
1
16 26 r =10 = A
16 1 r=1 MSB
Figure 8. Hexa-dabble method of converting a decimal number to its hexadecimal equivalent.


11
HEXADECIMAL TO BINARY CONVERSIONS
To convert a hexadecimal number to a binary number, change each hexadecimal

digit to its 4-bit binary equivalent. As example, lets convert FAF16 to its binary equivalent.
F A F
1111 1010 1111
Therefore, we can say that FAF16 = 1111101011112. However, for easier reading, it is
appropriate to show the binary numbers with spaces between each 4-bit nibble, such as:
FAF16 = 1111 1010 11112
BINARY TO HEXADECIMAL CONVERSIONS
To go from a binary to hexadecimal number, simply reverse the process. For

example, to convert binary 101000010012 to its hexadecimal equivalent, break the binary
number into 4-bit group. You must begin grouping from the far right. Then convert each 4-bit
group to its hexadecimal equivalent. That is:
0101 0000 1001

5 0 9
(Notice that the 4-bit group on the left begins with a zero. When the MSB of the binary
equivalent is 0, it can be dropped without affecting the value of the binary number.) Thus,
1010000010012 = 50916.
You can see how much shorter it is to say, think, and write 50916 than one, zero, one,
zero, zero, zero, zero, one, zero, zero, one. Hexadecimal numbers are simply much easier
for technicians and engineers to deal with. The process of replacing long strings of data such
as 10100001001 with a much shorter string, such as 50916, is known as chunking. See Table
1 for a comparison of binary, decimal, and hexadecimal numbers.
Table 1. Binary, Decimal and Hexadecimal Numbers Compared
Binary Decimal Hexadecimal

0000 0 0
0001 1 1
0010 2 2
0011 3 3

12
0100 4 4
0101 5 5
0110 6 6
0111 7 7
1000 8 8
1001 9 9
1010 10 A
1011 11 B
1100 12 C
1101 13 D
1110 14 E
1111 15 F
BINARY CODED Decimal Binary Coded Decimal DECIMAL SYSTEM

0 0000
Another very 1 0001 commonly used
number system in 2 0010 the field of digital
electronics is the 3 0011 binary coded
decimal (BCD) 4 0100 system. This system
is different from the 5 0101 ordinary number
6 0110
system in that it expresses each
7 0111
decimal digit as a 4- bit nibble. For
8 1000
example, it may be 9 1001 desirable or
necessary to 10 001 0000 convert 48910 to a
binary coded 11 001 0001 decimal. It is done
as follows: 12 001 0010
128 001 0010 1000 4

8 129 001 0010 1001 9
0100
1000 1001
Note that the highest BCD value that a 4-bit nibble could represent is 9, which would
be 10012 in binary. See Table 2 for decimal numbers and their equivalent BCD values. When
using the BCD number system, remember that all zeros must be retained, unlike a binary
number where leading zeros can be dropped.
The BCD number system is used when it is necessary to transfer decimal information
into or out of a digital machine. Examples of digital machines include digital clocks,
calculators, digital voltmeter, and frequency counters.
Table 2. Binary Coded Decimal (BCD) Values

13
THE ASCII CODE
For information to be transferred into or out of a computer, numbers, letters, and

several other symbols must be translated into binary code. The system used is the American
Standard Code for Information Interchange, or ASCII (pronounced “ask-key”). The ASCII
code is an alphanumeric code; it has binary values for each letter, number and symbols. The
ASCII code has been used to standardize codes for numbers, letters, and symbols in
equipment such as printers, keyboards, and computer displays. Each keystroke on an ASCII
keyboard produces a corresponding binary code for the designated character.
The breakdown of the ASCII code is shown in Table 3. Each number, letter, and
symbol is represented by a 7-bit binary word in the form of X 6, X5, X4, X3, X2, X1, X0, where X6
is the first bit. As an example, the ASCII code for the capital letter “W” is 1010111. Table 3
shows that the X6, X5, X4 bits are 101 and the X3, X2, X1, X0 bits are 0111.
Table 3 Binary Values in the ASCII Code
X6 X5 X4
X3 X2 X1 X0 010 011 100 101 110 111
0000 SP 0 @ P p
0001 ! 1 A Q a q
0010 “ 2 B R b r
0011 # 3 C S c s
0100 $ 4 D T d t
0101 % 5 E U e u
0110 & 6 F V f v
0111 ‘ 7 G W g w
1000 ( 8 H X h x
1001 ) 9 I Y i y
1010 * : J Z j z
1011 + ; K k
1100 , < L l
1101 _ = M m

14
1110 . > N n
1111 / ? O o
Lesson
LOGIC GATES, SYMBOLS, AND TRUTH
2 TABLE
A logic gate is a circuit that has one or more input signals but only one output signal.
All logic gates can be analyzed by constructing a truth table. Truth tables list all input
possibilities and the corresponding output for each input.
Inverters
The inverter is the simplest of all logic gates. It has only one input and one output,
where the output is the opposite of the input. The schematic symbol for a logic inverter is
shown in Figure 9 a and b. (The small bubble on the inverter diagram represent inversion.
Notice that the bubble can be shown on either the input or output side without affecting the
way the inverter operates. The reason why the bubble is shown on one or the other side for
logic diagrams will be discussed in Figure 10).
A binary 0 represent 0 V, and a binary 1 represent +5V. It is common to refer to a

binary 0 as a LOW input or output, and a binary 1 as HIGH input or output. The logic inverter
works like this: When the input A is LOW, or at 0 V, the output X is HIGH, or at + 5 V. Also, when
the input A is HIGH, or at +5 V, the output X is LOW, or at 0 V.
The number of input possibilities for the truth table in Figure 9 c is 21 or 2, because
the logic gates in Figure 9 a and b have only one input. We know the input can be either 0 or
1. In general, the number of possibilities listed in the truth table is 2 N, where N is the
number of inputs to the logic gate.
A X
(a)
A X
(b)
A X
0 1
1 0

15
(c)
Figure 9. Inverter logic gates. (a) Logic symbol with bubble at output. (b) Bubble at input. (c) Truth
OR Gate
Another commonly used logic gate is the OR gate. An OR gate has two or more
inputs but only one output. The logic symbol for a 2-input OR gate and its truth table are
shown Figure 10.
For any OR gate, the output X is LOW when all inputs are LOW. However, the output X
of any OR gate is HIGH if any or all inputs are HIGH. The OR gate in Figure 10 will have a
HIGHX output if either or both inputs A and B are LOW. Notice that for a 2-input truth
table there are 22 (or 4) input combinations of 0s and 1s.
Now look at Figure 11, which shows a 3-input OR gate and its corresponding
truth table. Notice in the truth table that the number of different input combinations
equals 23, or 8. The output X in the truth table of Figure 11 is LOW only when all
inputs A, B and C are LOW. When any or all inputs A, B and C are HIGH, the output X is
HIGH. The logic symbol for a multiple-input OR gate is basically the OR gate symbol
drawn with the required number of inputs.
A
X
B
(a)
A B X
0 0 0
0 1 1
1 0 1
1 1 1
(b)
Figure 10. Two-input OR gate. (a) Logic symbol. (b) Truth table
AND Gates
The AND gate is another logic gate. An AND gate has two or more inputs but only
one output. The logic symbol for a 2-input AND gate and its truth table are shown in Figure
12. For any AND gate, the output X is HIGH when all inputs are HIGH. However, the output X of
any AND gate is LOW if any or all inputs are LOW. For the 2-input AND gate in Figure 12, the
16
output X is HIGH only when both input A and B are HIGH. The output X is LOW if either or both
inputs A and are LOW.
Figure 13 shows the logic symbol and truth table for 3-input AND gate. Notice from
the truth table that the output is HIGH only when all inputs A, B and C are HIGH. Also notice that
the output is LOW for all other input combinations because at least one of the inputs A, B, or C
is LOW.
The logic symbol for a multiple-input AND gate uses a basic AND gate symbol drawn
with the required number of inputs.
NOR Gates
The NOR gate has two or more inputs nut only one output. The logic symbol for a 2-
input NOR gate and its truth table are shown in Figure 14a. The output X is LOW if either or
both inputs A and B are HIGH. The output X is HIGH only when both inputs A and B are LOW.
The NOR gate actually perform a logic function identical to that of an OR gate
followed by an inverter. This is shown in Figure 14b. Notice that the output of the OR gate is
connected to the input of the inverter. If the output of the OR gate is HIGH, then the inverter
output X is LOW. If the output of the OR gate is LOW, then the output X is HIGH. Therefore, the truth
table for the logic circuit in Figure 14b is the same as for the NOR fate in Figure 14a.
A NOR gate with three or more inputs reacts the same way as a 2-input NOR gate.
That is, the output X is LOW if any or all inputs are HIGH, and the output X is HIGH only when all
inputs are LOW
A A
B X B X
C C
(a) A (a)
X
B
A B C X A B C X
0 0 0 0 0 0 0 0
0 0 1 1 (a) 0 0 1 1
0 1 0 1 0 1 0 1
0 1 1 1 A B X 0 1 1 1
1 0 0 1 0 0 0 1 0 0 1
1 0 1 1 0 1 0 1 0 1 1
1 1 0 1 1 0 0 1 1 0 1
1 1 1 1 1 1 1 1 1 1 1
(b) (b) (b)

Figure 11. Three-input OR gate. (a) Figure 12. Two-input AND gate. (a) Figure 13. Three-input AND gate.
Logic symbol. (b) Truth Table Logic symbol. (b) Truth Table (a) Logic symbol. (b) Truth Table
Source: Grob Basic Electronics, 7th Source: Grob Basic Electronics, 7th Source: Grob Basic Electronics, 7th
Edition Edition Edition
17
A B X A B X
A 0 0 1 A 0 0 1
X 0 1 1
X 0 1 0
B
B 1 0 0 1 0 1
1 1 0 1 1 0
(a) (a)
A A
X X
B B
(b) (b)
Figure 14. The NOR gate. (a) Logic symbol and truth Figure 15. The NAND gate. (a) Logic symbol and truth
table. (b) Equivalent logic circuit for a NOR gate. table. (b) Equivalent logic circuit for a NAND gate.
Source: Grob Basic Electronics, 7th Edition Source: Grob Basic Electronics, 7th Edition
NAND Gates
The NAND gate also has two or more inputs but only one output. The logic symbol for
a 2-input NAND gate and its truth table are shown in Figure 15-a. Notice that the output is
HIGH if either or both input A and B are LOW. The output X is LOW only when A and B are HIGH. The
NAND gate actually performs a logic function identical to that of an AND gate followed by an
inverter. This is shown in Figure 15-b.
Figure 15-b shows that the output X of the AND gate is connected to the input of the
inverter. If the output of the AND gate is HIGH, then the output X is LOW. If the output of the AND
gate is LOW, then the output X is HIGH. Therefore, the truth table for the logic circuit in Figure 15-
b is the same as for the NAND gate in Figure 15-a.
A NAND gate with three or more inputs reacts the same way as a 2-input NAND gate.
That is, the output X is HIGH when any or all inputs are LOW, and the output X is LOW only when all
inputs are HIGH.
Exclusive OR (XOR) and Exclusive NOR (XNOR) Gates
Two other logic gates are exclusive OR and exclusive NOR gate. The logic symbols
and truth table for each are shown in Figure 16. Notice that for the XOR gate in Figure 16-a
the output X is HIGH only when the inputs A and B are different. For a multiple-input XOR gate
with three or more inputs, the output X will be HIGH only if an odd number of 1s is applied to
the inputs. If an even number of 1s is applied to the inputs of an XOR gate, then the output X
is LOW.
18
For the XNOR gate in Figure 16-b the output X is HIGH only when both inputs are the
same. The XNOR gate is equivalent to an XOR gate followed by an inverter. For a multiple-
input XNOR gate with three or more inputs, the output X will be HIGH only when an even
number of 1s is applied to the inputs. If an odd number of 1s is applied to the inputs of an
XNOR gate, the output X will be LOW. It is important to note that zero 1s is even number when
looking at the truth table.
A B X
0 0 0
A
0 1 1
X
1 0 1
B
1 1 0
(a)
A B X
A 0 0 1
X 0 1 0
B
1 0 0
1 1 0
(b)
Figure 16. The XOR and XNOR gates. (a Logic symbol and truth table for a 2-input XOR gate. Note the extra
curved line at the front of the symbols. (b). Logic symbol and truth table for a 2-input XNOR gate.
Table 4 shows each of the seven basic logic gates, which may be illustrated by either
the traditional "Distinctive Shape" ANSI symbol or the newer rectangular IEC symbol, and a
written description of its logic function compared with its Boolean equation.

19
Table 4
Source: https://learnabout-electronics.org/Digital/dig21.
Logic Integrated Circuits
Figure 17 illustrates a selection of the basic logic gates that are available from a
number of manufacturers in standard families of integrated circuits. Each logic family is
designed so that gates and other logic ICs within that family (and other related families) can
be easily combined, and built into larger logic circuits to carry out complex functions with the
minimum of additional components.
Typically, standard logic gates are available in 14 pin or 16 pin DIL (dual in line)
chips. The number of gates per IC varies depending on the number of inputs per gate.
Two−input gates are common, but if only a single input is required, such as in the 7404
NOT(or inverter) gates, a 14 pin IC can accommodate 6 (or Hex) gates. The greatest
number of inputs on a single gate is on the 74133 13 input NAND gate, which is
accommodated in a 16 pin package.

20
Figure 17. Logic Gates From the 74 series TTL IC Family
Source: https://learnabout-electronics.org/Digital/dig21.
Lesson DIODES AND TRANSISTORS AS

SWITCHES
21
3
Transistor as Switch
One of the most common uses for transistors in an electronic circuit is as simple
switches. In short, a transistor conducts current across the collector-emitter path only when a
voltage is applied to the base. When no base voltage is present, the switch is off. When
base voltage is present, the switch is on.
In an ideal switch, the transistor should be in only one of two states: off or on. The
transistor is off when there’s no bias voltage or when the bias voltage is less than 0.7 V. The
switch is on when the base is saturated so that collector current can flow without restriction.
This is a schematic diagram for a circuit that uses an NPN transistor as a switch that
turns an LED on or off.
Figure 18. Schematic Diagram for Circuit that uses NPN Transistor
Source: https://www.dummies.com/programming/electronics/components/electronics-components-use-a-transistor-as-a-switch
Look at this circuit component by component:

22
 LED: This is a standard 5 mm red LED. This type of LED has a voltage drop of 1.8 V
and is rated at a maximum current of 20 mA.
 R1: This 330 Ω resistor limits the current through the LED to prevent the LED from
burning out. You can use Ohm’s law to calculate the amount of current that the resistor
will allow to flow. Because the supply voltage is +6 V, and the LED drops 1.8 V, the
voltage across R1 will be 4.2 V (6 – 1.8). Dividing the voltage by the resistance gives
you the current in amperes, approximately 0.0127 A. Multiply by 1,000 to get the current
in mA: 12.7 mA, well below the 20 mA limit.
 Q1: This is a common NPN transistor. A 2N2222A transistor was used here, but just
about any NPN transistor will work. R1 and the LED are connected to the collector, and
the emitter is connected to ground. When the transistor is turned on, current flows
through the collector and emitter, thus lighting the LED. When the transistor is turned
off, the transistor acts as an insulator, and the LED doesn’t light.
 R2: This 1 kΩ resistor limits the current flowing into the base of the transistor. You
can use Ohm’s law to calculate the current at the base. Because the base-emitter
junction drops about 0.7 V (the same as a diode), the voltage across R2 is 5.3 V.
Dividing 5.3 by 1,000 gives the current at 0.0053 A, or 5.3 mA. Thus, the 12.7 mA
collector current (ICE) is controlled by a 5.3 mA base current (IBE).
 SW1: This switch controls whether current is allowed to flow to the base. Closing this
switch turns on the transistor, which causes current to flow through the LED. Thus,
closing this switch turns on the LED even though the switch isn’t placed directly within
the LED circuit.
You might be wondering why you’d need or want to bother with a transistor in this
circuit. After all, couldn’t you just put the switch in the LED circuit and do away with the
transistor and the second resistor? Of course you could, but that would defeat the principle
that this circuit illustrates: that a transistor allows you to use a small current to control a
much larger one.
If the entire purpose of the circuit is to turn an LED on or off, by all means omit the
transistor and the extra resistor. But in more advanced circuits, you’ll find plenty of cases
when the output from one stage of a circuit is very small and you need that tiny amount of

23
current to switch on a much larger current. In that case, this transistor circuit is just what you
need.
Working of Diode as a Switch

Whenever a specified voltage is exceeded, the diode resistance gets increased,
making the diode reverse biased and it acts as an open switch. Whenever the voltage
applied is below the reference voltage, the diode resistance gets decreased, making the
diode forward biased, and it acts as a closed switch.
The following circuit explains the diode acting as a switch.
Figure 19. Switching Circuit using Diode

Source: https://www.tutorialspoint.com/electronic_circuits/electronic_circuits_diode_as_switch
A switching diode has a PN junction in which P-region is lightly doped and N-region
is heavily doped. The above circuit symbolizes that the diode gets ON when positive
voltage forward biases the diode and it gets OFF when negative voltage reverse biases the
diode.
Ringing
As the forward current flows till then, with a sudden reverse voltage, the reverse
current flows for an instance rather than getting switched OFF immediately. The higher the
leakage current, the greater the loss. The flow of reverse current when diode is reverse
biased suddenly, may sometimes create few oscillations, called as RINGING.
This ringing condition is a loss and hence should be minimized. To do this, the
switching times of the diode should be understood.
Diode Switching Times

While changing the bias conditions, the diode undergoes a transient response. The
response of a system to any sudden change from an equilibrium position is called as
transient response.
The sudden change from forward to reverse and from reverse to forward bias,
affects the circuit. The time taken to respond to such sudden changes is the important
criterion to define the effectiveness of an electrical switch.
 The time taken before the diode recovers its steady state is called as Recovery
Time.

24
 The time interval taken by the diode to switch from reverse biased state to forward
biased state is called as Forward Recovery Time. $tfr$
 The time interval taken by the diode to switch from forward biased state to reverse
biased state is called as Reverse Recovery Time. $tfr$
To understand this more clearly, let us try to analyze what happens once the voltage
is applied to a switching PN diode.
Carrier Concentration
Minority charge carrier concentration reduces exponentially as seen away from the
junction. When the voltage is applied, due to the forward biased condition, the majority
carriers of one side move towards the other. They become minority carriers of the other
side. This concentration will be more at the junction.
For example, if N-type is considered, the excess of holes that enter into N-type after
applying forward bias, adds to the already present minority carriers of N-type material.
Let us consider few notations.
 The majority carriers in P-type holes = Ppo

 The majority carriers in N-type electrons = Nno
 The minority carriers in P-type electrons = Npo
 The majority carriers in N-type holes= Pno
During Forward biased Condition − The minority carriers are more near junction and less
far away from the junction. The graph below explains this.
Figure 20. Forward Biased Condition


25
Excess minority carrier charge in P-type = Pn − Pno with pno
steadystatevalue
Excess minority carrier charge in N-type = Np − Npo with Npo

steadystatevalue
During reverse bias condition − Majority carriers doesn’t conduct the current through the
junction and hence don’t participate in current condition. The switching diode behaves as a
short circuited for an instance in reverse direction.
The minority carriers will cross the junction and conduct the current, which is called
as Reverse Saturation Current. The following graph represents the condition during
reverse bias.
Figure 21. Reverse Bias Condition

In the above figure, the dotted line represents equilibrium values and solid lines
represent actual values. As the current due to minority charge carriers is large enough to
conduct, the circuit will be ON until this excess charge is removed.
The time required for the diode to change from forward bias to reverse bias is
called Reverse recovery time $trr$. The following graphs explain the diode switching
times in detail.

26
Figure 22. Diode Switching Times

27
From the above figure, let us consider the diode current graph.
At t1 the diode is suddenly brought to OFF state from ON state; it is known as
Storage time. Storage time is the time required to remove the excess minority carrier
charge. The negative current flowing from N to P type material is of a considerable amount
during the Storage time. This negative current is,
−IR= −VR
R
The next time period is the transition time” from$t2$to$t3$
Transition time is the time taken for the diode to get completely to open circuit
condition. After t3 diode will be in steady state reverse bias condition. Before t1 diode is
under steady state forward bias condition.
So, the time taken to get completely to open circuit condition is
Reverse recovery time(trr)=Storage time(Ts) + Transition time(Tt)
Whereas to get to ON condition from OFF, it takes less time called as Forward
recovery time. Reverse recovery time is greater than Forward recovery time. A diode
works as a better switch if this Reverse recovery time is made less.
Definitions
Let us just go through the definitions of the time periods discussed.
 Storage time − The time period for which the diode remains in the conduction state
even in the reverse biased state, is called as Storage time.
 Transition time − The time elapsed in returning back to the state of non-conduction,
i.e. steady state reverse bias, is called Transition time.
 Reverse recovery time − The time required for the diode to change from forward
bias to reverse bias is called as Reverse recovery time.
 Forward recovery time − The time required for the diode to change from reverse
bias to forward bias is called as Forward recovery time.
Factors that affect diode switching times

There are few factors that affect the diode switching times, such as
 Diode Capacitance − The PN junction capacitance changes depending upon the
bias conditions.
 Diode Resistance − The resistance offered by the diode to change its state.
 Doping Concentration − The level of doping of the diode, affects the diode
switching times.
 Depletion Width − The narrower the width of the depletion layer, the faster the
switching will be. A Zener diode has narrow depletion region than an avalanche
diode, which makes the former a better switch.

28
Applications
There are many applications in which diode switching circuits are used, such as −
 High speed rectifying circuits

 High speed switching circuits
 RF receivers
 General purpose applications
 Consumer applications
 Automotive applications
 Telecom applications etc.
Key Differences Between Diode and Transistor
1. The diode is a semiconductor device which allows the current to flow only in one direction,
whereas the transistor transfers the resistance from the low resistance region to high
resistance region.
2. The diode is used for converting the AC to DC or for rectifications whereas the transistor
is mainly used for amplification and as a regulator.
3. The diode has two terminals namely anode and cathode. The anode is the positive
terminal, and the cathode is the negative terminal of the diode. The transistor has three
terminals; they are the emitter, collector and base.
4. The diode is a type of uncontrolled switch whereas the transistor is a controlled switch.
5. The transistor is mainly classified into two types, i.e., the Bipolar junction transistor and
Field Effecting Transistor. The BJT uses both the electrons and hole as a charge carrier, and
the FET is a unipolar transistor. The diode has many types, for example, photodiodes, Zener
Diode, Tunnel Diode, Varactor Diode, etc.
6. The P-type and N-type is the two region of the diode. The hole is the majority charge
carrier of the P-region and electrons is the majority charge carrier of the N – region of the
diode. The transistor has three regions, namely emitter, base and collector. Among the three
regions, the base is the smallest region, and the collector is the largest region of the
transistor.
7. The diode has only one depletion layer between P – type and N – type whereas the
transistor has two depletion layer, one is between emitter and base region, and the other is
between the base and collector region.
It is considered that the transistor consists two PN junction diode. But two discrete
diode connected back to back never work as a transistor.

29
Electrical Switches over Mechanical Switches
Electrical switches are a preferred choice over mechanical switches due to the
following reasons −
 Mechanical switches are prone to oxidation of metals whereas electrical switches don’t.
 Mechanical switches have movable contacts.
 They are more prone to stress and strain than electrical switches.
 The worn and torn of mechanical switches often affect their working.
Hence an electrical switch is more useful than a Mechanical switch.
What’s More
CALCULATING DATA STORAGE
While a bit is the smallest representation of data, the most basic unit of digital storage
is the byte. A byte is 8 bits and is the smallest unit of measure (UOM) used to represent data
storage capacity.
When referring to storage space, we use the terms bytes (B), kilobytes (KB),
megabytes (MB), gigabytes (GB), and terabytes (TB).
One kilobyte is a little more than one thousand bytes, specifically 1,024. A megabyte
represents more than a million bytes or 1,048,576. A gigabyte is 1,073,741,824 bytes. A
terabyte is 1,099,511,627,776. The exact number is gained by taking 2^n power.
Quantities of bytes
Common prefix Binary prefix
Name Symbol Decimal Binary Name Symbol Binary
SI JEDEC IEC
kilobyte KB/Kb 103 210 kibibyte KiB 210
megabyte MB 106 220 mebibyte MiB 220
gigabyte GB 109 230 gibibyte GiB 230
terabyte TB 1012 240 tebibyte TiB 240
petabyte PB 1015 250 pebibyte PiB 250
exabyte EB 1018 260 exbibyte EiB 260
zettabyte ZB 1021 270 zebibyte ZiB 270
yottabyte YB 1024 280 yobibyte YiB 280
Table 5. Quantities of Bytes
Source: ICT 7/8 Learning Module.pdf

30
In general, when something is represented digitally, the greater the detail, the greater
the number of bits needed to represent it. A low-resolution picture from a digital camera will
use around 360KB, and a high-resolution picture could use 2 MB or more.
Kilobytes, megabytes, gigabytes, and terabytes are typically used to measure the
size or storage capacity of a device. Examples of components and devices that use byte
storage include: random access memory (RAM), hard disk drive space, CDs, DVDs, and
MP3 players.
CDs have a data storage capacity of approximately 700 MB. DVDs have a data
storage capacity of approximately 4.3 GB on a single-layer disc, and approximately 8.5 GB
on a dual-layer disc. BDs have a storage capacity of 25 GB on a single-layer disc, and 50 GB
on a dual-layer disc.
Once we know the size of a file or folder, it is possible to determine the number of bytes
being used. For example:
A file is 20 KB in size
1 KB = 1,024 Bytes
20 * 1,024 = 20,480 bytes in a 20 KB file
If a 20 KB file is stored in a 1 MB folder (1 MB = 1,048,576 bytes of space); then

approximately a total of 51 files can be stored in that folder (1,048,576 / 20,480 = 51.2).
What I Have Learned
It is necessary to familiarize ourselves with the world of digital electronics specially all
the number system as well as the procedure on how to convert from one form to another.

31
What I Can Do
I. CREATIVE CONSTRUCTED RESPONSE TEST ITEM (20 Points)
LEARNING COMPETENCY: 1. Discuss Binary numbers operation
2. Identify different Logic gates
3. Discuss Logic IC
4. Discuss Diodes and transistors as switches
OBJECTIVES:
1. Discuss Different Number System
2. Describe the action of logic gates.
- AND, OR, NAND, NOR, NOT, XOR and XNOR.
- Using truth tables.
3. Understand the use of universal gates.
- NAND.
- NOR.
4. Recognize common 74 series ICs containing standard logic gates.
5. Differentiate Diode and Transistor as Switches.
SITUATION: Chadz wanted to familiarize himself with the different Logic Gates, he wanted
you to draw and label different Logic Gates with its respective truth table on
long bond paper.
Standard Master Qualified Apprentice Novice Points

Artist Artist Artist Artist Earned
50% 40% 30% 20%
Art Skill Completes Only 6 Logic Only 4 Logic Only 1 Logic
(50%) all logic Gates are Gates are Gates is
gates with drawn and drawn and drawn and
label and its labeled labeled labelled
respective correctly correctly with correctly
truth table with its its respective with its
respective truth table respective
truth table truth table
Craftmanshi Presents all Present Present Present

32
p (50%) work neatly most work some work work with
neatly neatly little
neatness
Assessment
CONVERSION
Direction: Convert the following numbers into its corresponding number system. Write your
answers with solution on a separate sheet of paper.
1. 3010 = _______2 11. 0010 1000 10102 = ________16
2. 11102 = _______10 12. 9110 = _________ 2
3. 12710 = _______2 13. FAD16 = _________2
4. 5610 = _______ 2 14. 4910 = _________2
5. 01112 = ______10 15. 1111 1001 00102 = ________16
6. 1410 = ________2 16. 7210 = _________2
7. 8810 = ________2 17. 1101 1100 00102 = _______16
8. DCA16 = ________2 18. 2410 = _________2
9. 2C1416 = ________2 19. ABC16 = ___________2
10. 0111 1011 00102 = _________16 20. 57810 = ___________BCD

33
Answer Key
PRE-ASSESSMENT POST-ASSESSMENT
1. 1000011 1. 11110
2.13 2. 14
3. 100100 3. 1111111
4. 11 4. 111000
5. 1010010 5. 7
6. 25 6. 1110
7. 101001 7.1011000
8. 28 8. 1101 1100 1010
9. 10011 9. 0010 1100 0001 0100
10. 42 10. 7b2
11. 28A
12. 1011011
13. 1111 1010 1101
ACTIVITY 1
14. 110001
1. DECIMAL
15. F92
2. BINARY
16. 1001000
3. HEXADECIMAL
17. DC2
4. LOGIC GATES
18. 11000
5. TRUTH TABLE
19. 1010 1011 1100
20. 0101 0111 1000
ACTIVITY 2
Q W E R T Y U I O P L K H
E H E X A D E C I M A L A
B V C X R E G H M V E R Y
D F G H O C T A L E D F H
Z C F G E I H X E R Y U K
A F R U B M I O B Y R C B
W V B I N A R Y E R H J I
P R E T Y L V C X V I O M
I O N H F D T E R T Y U I

34
References
https://www.researchgate.net/publication/264005171_Digital_Electronics/link/53fca84a0cf23
64ccc04b6dd/download
circuitglobe.com
https://www.asc.ohio-state.edu/gan.1/teaching/summer04/Lec5.pdf
https://learnabout-electronics.org/Digital/dig21.
- ICT 7/8 Learning Module.pdf
- https://learnabout-electronics.org/Downloads/Digital-Electronics-Module-05.pdf
- Grob, Bernard. Grob Basic Electronics, 7th Edition; New York: Mc Graw-Hill Book
Company: 1993
- https://www.dummies.com
- https://circuitglobe.com
- https://www.tutorialspoint.com/
Enriquez, Michael Q., Gantalao, Fred T., Lasala, Rommel M. Simple Electronics (Basic),
pp11-25, Andres Mountain Printers: 2004
Technical Education and Skills Development Authority (TESDA). “Consumer Electronics

Servicing II”. Accessed October 8, 2012. http://www.tesda.gov.ph/inc/files/Consumer
%20Electronics%20Servicing%20NC%2 0II.doc.

35
For inquiries or feedback, please write or call:
Department of Education – Schools Division of Laoag City

Curriculum Implementation Division
Brgy. 23 San Matias, Laoag City, 2900
Contact Number: (077)-771-3678
Email Address: laoag.city@deped.gov.ph

36

Electronics Module g10 q2 Week 1 2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Electronics Module g10 q2 Week 1 2

Uploaded by

Copyright:

Available Formats

WHOLE BRAIN LEARNING SYSTEM

OUTCOME -BASED EDUCATION

WBLS-OBE MELC-Aligned Self-Learning Module Electronics (Grade 10)

Writer: Richard F. Aison

Editor: Ponciano S. Raspado

Reviewer: Hamilton C. Remigio

Management Team: Vilma D. Eda, CESO V

Joye D. Madalipay Arnel S. Bandiola

Juanito V. Labao Flenie A. Galicinao

What I Need to Know

WBLS-OBE MELC-Aligned Self-Learning Module Electronics (Grade 10)

Most Essential Learning Competencies

1. Discuss Binary numbers operation

2. Identify different Logic gates

4. Discuss Diodes and transistors as switches

1. Discuss Different Number System

2. Describe the action of logic gates.

- AND, OR, NAND, NOR, NOT, XOR and XNOR.

- Using truth tables.

3. Understand the use of universal gates.

4. Recognize common 74 series ICs containing standard logic gates.

5. Differentiate Diode and Transistor as Switches.

WBLS-OBE MELC-Aligned Self-Learning Module Electronics (Grade 10)

1. 6710 = __________2 6. 110012 = _________10

2. 011012 = _________10 7. 4110 = ___________2

3. 3610 = ________2 8. 111002 = _________10

4. 010112 = _________10 9. 1910 = ___________2

5. 8210 = ____________2 10. 1010102 = ________10

WBLS-OBE MELC-Aligned Self-Learning Module Electronics (Grade 10)

1 BINARY NUMBERS OPERATION

Within a computer, information is represented and

A bit can have only two possible values, a one digit

Capital letter: A = 01000001

Special character: # = 00100011

COMPARING BINARY AND DECIMAL NUMBERS

2000 + 300 + 60 + 7 = 2367

105 104 103 102 101 100

Figure 3. Weight distribution for decimal number system

DECIMAL TO BINARY CONVERSION

It may be desirable or necessary to convert a decimal number to its binary equivalent.

DECIMAL TO OCTAL CONVERSION

The process of decimal-to-octal conversion is similar to that of decimal-to-binary

We will find the octal equivalent of (73.75)10

• The integer part = 73

Divisor Dividend Remainder

• The octal equivalent of (73)10 = (111)8

• The fractional part = 0.75

• 0.75 × 8 = 0 with a carry of 6

WBLS-OBE MELC-Aligned Self-Learning Module Electronics (Grade 10)

• Therefore, the octal equivalent of (73.75)10= (111.6)8

OCTAL NUMBER SYSTEM

OCTAL TO DECIMAL CONVERSION

The decimal equivalent of the octal number (137.21)8 is determined as follows:

• The integer part = 137

• The decimal equivalent = 7 × 80 + 3 × 81 + 1 × 82 = 7 + 24 + 64 = 95

• The fractional part = .21

• The decimal equivalent = 2 × 8−1 + 1 × 8−2 = 0.265

• Therefore, the decimal equivalent of (137.21)8 = (95.265)10

Hexadecimal numbers are used extensively in the microcomputer field. As we will

WBLS-OBE MELC-Aligned Self-Learning Module Electronics (Grade 10)

Figure 6. Weight distribution for hexadecimal number system

1,048,576 65,536 4096 256 16 1

F F F 3840 + 240 + 15 = 4095

1. 6710 = __2 6. 110012 = _10

2. 011012 = _10 7. 4110 = ___2

3. 3610 = 2 8. 111002 = _10

4. 010112 = _10 9. 1910 = ___2

5. 8210 = ____2 10. 1010102 = 10