Examples:

Value 27 @ 10% 56 @ 10% 180 @ 5% 390 @ 10% 680 @ 5% 1.5 k @ 20% 3.6 k @ 10% 7.5 k @ 5% 10 k @ 5% 47 k @ 10% 820 k @ 10% 2.2 M @ 20 % Band 1 Red Green Brown Orange Blue Brown Orange Violet Brown Yellow Gray Brown Band 2 Violet Blue Gray White Gray Green Blue Green Black Violet Red Brown Band 3 Black Black Brown Brown Brown Red Red Red Orange Orange Yellow Green Band 4 Silver Silver Gold Silver Gold None Silver Gold Gold Silver Silver None

Colors red-red-black-silver blue-gray-black-gold brown-green-brown-gold orange-orange-brown-silver green-blue-brown gold brown-red-redsilver red-violet-redsilver gray-red-redgold brown-black-orangegold orange-orange-orangesilver blue-gray-yellownone green-black-green-silver

Resistance 22 68 150 330 560 1200 2700 8200 10000 33000 680000 5000000

Tolerance 10% 5% 5% 10% 5% 10% 10% 5% 5% 10% 20% 10%

Minimum 19.8 64.6 142.5 297 532 1080 2430 7790 9500 32670 544000 4500000

Maximum 24.2 71.4 157.5 363 588 1320 2970 8610 10500 33330 816000 5500000

Internal Configuration of ICs (74series)

Analog Quantity: It is the quantity having continuous values such as used in electronics, up to now the values of voltages are continuous so called analog values. For such an analog system any value is applicable. Digital Quantity: It is the quantity having discrete values such as 0 or 1. There are no between values of 0 and 1. Such a system in which only 0 and 1 are used is called Binary system. In this system 0 and 1 each is called a bit. LOGIC FUNCTIONS: Any decision that can be answered yes/no or true/false can be mathematically represented as a combination of logic functions. History: George Boole invented and published this form of mathematics (Boolean algebra) in 1847. Many of things are those which have only two possible conditions like a circuit is ON or OFF. There is no third possibility. Those things which have only two possible conditions are called Boolean Variables. These have only two values 1 and 0. Different operations of Boolean Variables: The 3 basic logic functions, which can be used to solve any Boolean equation, are: Basic Operations of Digital Electronics: (1) NOT operation (2) AND operation (3) OR operation (Inverting operation) (DOT . operation) (ADD + operation)

(4) Fundamental Logic Gates: The electronic circuits which implement the various logic operations are called logic gates. In these gates the high and low state, i.e., 1 and 0 states are simulated by certain voltage levels. Ideally one particular voltage level represents a high (1) and another voltage level represents a low (0). In practical digital circuits, however a 1or high can be any voltage between a specified minimum value and specified maximum value. Like 0 or low can be any voltage between a specified minimum and a specified maximum shows the range 1 and 0

levels for a certain type of digital gates. Thus if a voltage of 3.5V is applied to a gate, it will accept it as high or 1. If a voltage of 0.5V is applied, the gate will recognize it as 0 or low. There are three basic logic gates. (1) OR Gate (2) AND Gate (3) NOT Gate OR Gate: OR Gate as symbolically represented in Fig. implements the logic of OR operation. Logic Symbol:

It has two or more inputs and single output X=A+B. The mathematical notation for OR operation is +. Logic operation for OR gate: The output has value 1 when at least one of its inputs A and B is at 1. Thus output will be zero only when both the inputs are 0. Thus it implements the truth table of OR operation. Truth table: This is a table that tells us all the possible outputs for all the possible combination of all the inputs. The combination of inputs N can be determined by the formula example, for three inputs n=3, the No.of combination of inputs is Four inputs n=4, the No. of combination of inputs is The truth table of OR operation for two inputs is as follows: . For .Similarly for

Truth Tables For OR Gate

(Input 1) A 0 0 0 0 1 1 1 1

(Input 2) (Input 3) (Output) B 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 C X=(A+B)+C 0 1 1 1 1 1 1 1

AND Gate: The AND Gate shown in figure has two or more input is and a single output. Logic Symbol:

Logic operation for AND gate: It is designed in such that it implements the truth table of AND operation, i.e., its output X is 1 only when both of its inputs A and B are at 1 and for all others combinations of the values of A and B, X is zero shown in table. The mathematical notation for AND operation is . and the truth table for AND Gate with two inputs is as follows: (Input 1) A 0 0 1 1 0 1 0 1 (Input 2) B (Output) X=A.B 0 0 0 1

(Input 1) A 0 0 0 NOT Gate: It performs the operation of inversion or complementation. That is why it is also known as inverter. It changes a logic level to its opposite level, i.e., it 0 1 1 1 1

(Input 2) B 0 0 1 1 0 0 1 1

(Input 3) C 0 1 0 1 0 1 0 1

(Output) X=(A.B).C 0 0 0 0 0 0 0 1

changes 1 to 0 and 0 to 1. The symbolic representation of NOT gate is shown figure. Logic Symbol:

Whenever a bar is placed on any variable, it shows that the value of variable has been inverted. The bubble (o) in figure indicates operation of inversion. Its truth is given in table. The mathematical notation for NOT operation is . The truth table for NOT Gate is as follows: (Input 1) A 0 1 OTHERS LOGIC GATES: FUNCTIONALLY COMPLETE GATES Any Boolean logic equation can be implemented with a combination of: AND gates & NOT gates OR gates & NOT gates Some gates are functionally complete. These gates can implement any combinational logic equation. These gates are: (Output) X= 1 0

NAND gates (contain both AND function & NOT function) NOR gates (contain both OR function & NOT function) So these gates are called Universal Gates. NOR Gate: In NOR gate the output of OR gate is inverted by a NOT Gate. Logic Symbol:

Logic operation for NOR gate: The output has value 1 when its both inputs A and B are at 0. Thus output will be zero when at least one input is 1.Its truth (Input 1) A 0 0 1 1 0 1 0 1 (Input 2) B (Output) X= 1 0 0 0 0 0 0 0 1 1 1 1 (Input 1) A 0 0 1 1 0 0 1 1 (Input 2) B 0 1 0 1 0 1 0 1 (Input 3) C (Output) X= 1 0 0 0 0 0 0 0

table for two inputs is

NAND Gate:

In NAND gate the output of AND gate is inverted. Its symbol is shown in figure.

The bubble in this figure shows that the output of AND gate is inverted. Logic operation for NAND gate: The output has value 0 when its both inputs A and B is at 1. Thus output will be one when at least any one input is at 0.The truth table is implemented by it is shown in table. (Input 1) A 0 0 1 1 0 1 0 1 (Input 2) B 1 1 1 0 Output 0 0 0 0 1 1 1 1 An I.C. has many logic gates of different kinds inside it. It has many legs. The no. of legs of an I.C. depends on the no. of gates and the no. of inputs and outputs in each gate. For example if there are four gates in an I.C. with two inputs in each gate and one output then there are 14 legs. If there are four gates in an I.C. with 3 inputs in each gate and one output then there are 18 legs. I.C. internal configurations: There is different I.C.s used for different logic operation. So, there are different types of gates in their internal configuration. (Input 1) A 0 0 1 1 0 0 1 1 (Input 2) B 0 1 0 1 0 1 0 1 (Input 3) C (Output) X= 1 1 1 1 1 1 1 0

The truth table for NAND Gate with four inputs is as follows: I.C. (Integrated circuit):

1st. & 2nd Color Band Digit it Represents -----Multiplier----BLACK BROWN RED ORANGE YELLOW GREEN BLUE 0 1 2 3 4 5 6
X1

X10 X100 X1,000 or 1K X10,000 or 10K X100,000 or 100K X1,000,000 or 1M