B.Sc.

FY (Electronics) (Semester I)

SELECT1101 (Theory): Fundamentals of Analog & Digital Electronics

Periods: 30 Hours
Max. Marks: 50 [ESE:40 & CA:10]
Credits : 2

SYLLABUS

Sr. Month Name of the Topic Perio

No. ds
1. July 2024 Unit I: Basic Circuit Analysis 07
Ohm's Law, Kirchhoff's Current Law (KCL),
Kirchhoff's Voltage Law (KVL), Sign Conventions
for Battery EMF and IR Drop on resistors. Series
Circuits: Proportional Voltage Formula and Voltage
Divider, Opens and Shorts in Series circuit. Parallel
Circuits: Proportional Current Formula, Opens and
Shorts in Parallel circuit.
2. August Unit II: Network Theorems 08
2024 Ideal constant-voltage source, ideal constant-current
source, Super Position theorem, Thevenin theorem,
Norton theorem and how to Thevenize and how to
Nortonise given circuit, Maximum Power Transfer
theorem
3. September Unit III: Number Systems and Codes 07
2024 Decimal, Binary Octal and Hexadecimal number
systems, inter-conversions of number systems,
Binary arithmetic (addition, subtraction,
multiplication, division), Codes : BCD, Gray code,
Conversion of BCD to Binary, Binary to Gray code
and vice versa.
4. October Unit IV: Logic Gates and Boolean Laws 08
2024 Positive logic, Negative logic, Definition, symbol
and truth table of NOT, OR, AND, NAND, NOR,
EX-OR, EX-NOR gates, De-Morgan’s theorem,
Universal properties of NAND and NOR gates,
Boolean Rules and Laws.
5. Total 30
Unit IV: Logic Gates and Boolean Laws

Logic Circuit
Boolean algebra is ideal for expressing the behavior of logic circuits. A circuit can be
expressed as a logic design and implemented as a collection of individual connected
logic gates.

Fixed Logic System

A fixed logic system has two possible choices for representing true and false.

Positive Logic
In a positive logic system, a high voltage is used to represent logical true (1), and a
low voltage for a logical false (0).

Negative Logic
In a negative logic system, a low voltage is used to represent logical true (1), and a
high voltage for a logical false (0). In positive logic circuits it is normal to use +5V
for true and 0V for false.

Logic gates are an important concept if you are studying electronics. These are
important digital devices that are mainly based on the Boolean function. Logic gates
are used to carry out logical operations on single or multiple binary inputs and give
one binary output. In simple terms, logic gates are the electronic circuits in a digital
system.

Types of Basic Logic Gates

There are several basic logic gates used in performing operations in digital systems.
The common ones are

•OR Gate
•AND Gate
•NOT Gate
 ➔ OR Gate
In an OR gate, the output of an OR gate attains state 1 if one or more inputs attain
state 1.

The OR gate is a digital logic gate with ‘n’ i/ps and one o/p, that performs logical
conjunction based on the combinations of its inputs. The output of the OR gate is true
only when one or more inputs are true. If all the i/ps of the gate are false, then only
the output of the OR gate is false. The symbol and truth table of an OR gate with two
inputs is shown below.

The Boolean expression of the OR gate is Y = A + B, read as Y equals A ‘OR’ B.

The truth table of a two-input OR basic gate is given above.

➔ AND Gate
In the AND gate, the output of an AND gate attains state 1 if and only if all the inputs
are in state 1.

The AND gate is a digital logic gate with ‘n’ i/ps one o/p, which performs logical
conjunction based on the combinations of its inputs. The output of this gate is true
only when all the inputs are true. When one or more inputs of the AND gate’s i/ps are
false, then only the output of the AND gate is false. The symbol and truth table of an
AND gate with two inputs is shown below.
 ➔ NOT Gate
The NOT gate is a digital logic gate with one input and one output that operates an

inverter operation of the input. The output of the NOT gate is the reverse of the input.

When the input of the NOT gate is true then the output will be false and vice versa.

The symbol and truth table of a NOT gate with one input is shown below. By using

this gate, we can implement NOR and NAND gates

➔ NAND Gate
The NAND gate is a digital logic gate with ‘n’ i/ps and one o/p, that performs the

operation of the AND gate followed by the operation of the NOT gate.NAND gate is

designed by combining the AND and NOT gates. If the input of the NAND gate high,

then the output of the gate will be low.The symbol and truth table of the NAND gate

with two inputs is shown below.

 ➔ NOR Gate
The NOR gate is a digital logic gate with n inputs and one output, that performs the

operation of the OR gate followed by the NOT gate. NOR gate is designed by

combining the OR and NOT gate. When any one of the i/ps of the NOR gate is true,

then the output of the NOR gate will be false. The symbol and truth table of the NOR

gate with the truth table is shown below.

➔ Exclusive-OR Gate
The Exclusive-OR gate is a digital logic gate with two inputs and one output. The

short form of this gate is Ex-OR. It performs based on the operation of the OR gate. .

If any one of the inputs of this gate is high, then the output of the EX-OR gate will be

high. The symbol and truth table of the EX-OR are shown below.
 ➔ Exclusive-NOR Gate
The Exclusive-NOR gate is a digital logic gate with two inputs and one output. The

short form of this gate is Ex-NOR. It performs based on the operation of the NOR

gate. When both the inputs of this gate are high, then the output of the EX-NOR gate

will be high. But, if any one of the inputs is high (but not both), then the output will

be low. The symbol and truth table of the EX-NOR are shown below.

The applications of logic gates are mainly determined based upon their truth table,
i.e., their mode of operations. The basic logic gates are used in many circuits like a
push-button lock, light-activated burglar alarm, safety thermostat, an automatic
watering system, etc.

De Morgan’s Theorem
The first theorem of DeMorgan states that the logic gate like NAND is equal to an

OR gate with a bubble. The logic function of the NAND gate is

A’B = A’+B’
The second theorem of DeMorgan states that the NOR logic gate is equal to an AND

gate with a bubble. The logic function of NOR gate is

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

Laws and Rules of Boolean algebra

In simplification of the Boolean expression, the laws and rules of the Boolean algebra
play an important role. Before understanding these laws and rules of Boolean algebra,
understand the Boolean operations addition and multiplication concept.

Boolean Addition
The addition operation of Boolean algebra is similar to the OR operation. In digital
circuits, the OR operation is used to calculate the sum term, without using AND
operation. A + B, A + B', A + B + C', and A' + B + + D' are some of the examples of
'sum term'. The value of the sum term is true when one or more than one literals are
true and false when all the literals are false.
Boolean Multiplication
The multiplication operation of Boolean algebra is similar to the AND operation. In
digital circuits, the AND operation calculates the product, without using OR
operation. AB, AB, ABC, and ABCD are some of the examples of the product term.
The value of the product term is true when all the literals are true and false when any
one of the literal is false.

Commutative Law
This law states that no matter in which order we use the variables. It means that the
order of variables doesn't matter. In Boolean algebra, the OR and the addition
operations are similar. In the below diagram, the OR gate display that the order of the
input variables does not matter at all.
For two variables, the commutative law of addition is written as:
A+B = B+A
Associative Law
This law states that the operation can be performed in any order when the variables
priority is same. As '*' and '/' have same priority. In the below diagram, the
associative law is applied to the 2-input OR gate.
For three variables, the associative law of addition is written as:
A + (B + C) = (A + B) + C
A(BC) = (AB)C
According to this law, no matter in what order the variables are grouped when
ANDing more than two variables. In the below diagram, the associative law is
applied to 2-input AND gate.

Distributive Law:
According to this law, if we perform the OR operation of two or more variables and
then perform the AND operation of the result with a single variable, then the result
will be similar to performing the AND operation of that single variable with each two
or more variable and then perform the OR operation of that product. This law
explains the process of factoring.
For three variables, the distributive law is written as:
A(B + C) = AB + AC
Rules of Boolean algebra
There are the following rules of Boolean algebra, which are mostly used in
manipulating and simplifying Boolean expressions. These rules plays an important
role in simplifying boolean expressions.

1. A+0=A 7. A.A=A

2. A+1=1 8. A.A'=0

3. A.0=0 9. A''=A

4. A.1=A 10. A+AB=A

5. A+A=A 11. A+A'B=A+B

6. A+A'=1 12. (A+B)(A+C)=A+BC