Name: Sudarshan Bhatta

Regd. No: 20BCE2919

Course: Digital Logic and Design - ELA

Experiment-1
OBJECTIVE:
• To study the basic logic gates: AND, OR, INVERT, NAND, and NOR.

• To study the representation of these functions by truth tables, logic diagrams

and Boolean algebra.

• To observe the pulse response of logic gates.

• To measure the propagation delay of logic gates.

APPARATUS:
− IC Type 7400 Quadruple 2-input NAND gates

− IC Type 7402 Quadruple 2-input NOR gates

− IC Type 7404 Hex Inverters

− IC Type 7408 Quadruple 2-input AND gates

− IC Type 7432 Quadruple 2-input OR gates

− IC Type 7486 Quadruple 2-input XOR gate

− IC Type 7493 4-bit ripple counter

− Digi-Designer Logic Board

− Dual-trace oscilloscope
 TASK-1: Logic functions

Aim: To study the basic logic gates: AND, OR, INVERT, NAND, and NOR.
Software used: ORCAD(Capture CIS lite)

1. AND GATE
Aim: To visualize AND gate.
Parts used: IC Type 7408 AND gate

Circuit
Result

Truth table

X Y X AND Y
0 0 0
0 1 0
1 0 0
1 1 1

Inference: Both inputs should be true for result to be true.

 2. OR GATE
Aim: To visualize OR gate.
Parts used: IC Type 7432 AND gate

Circuit
Result

Truth table

X Y X OR Y
0 0 0
0 1 1
1 0 1
1 1 1

Inference: One of the inputs should be true for result to be true.

 3. NAND GATE
Aim: To visualize NAND gate.
Parts used: IC Type 7400 NAND gate

Circuit
Result

Truth table

X Y X NAND Y
0 0 1
0 1 1
1 0 1
1 1 0

Inference: Both of the inputs should be true for result to be false.

 4. NOR GATE
Aim: To visualize NOR gate.
Parts used: IC Type 7402 NOR gate

Circuit
Result

Truth table

X Y X NOR Y
0 0 1
0 1 0
1 0 0
1 1 0

Inference: Both of the inputs should be false for result to be true.

 5. XOR GATE
Aim: To visualize XOR gate.
Parts used: IC Type 7486 NOR gate

Circuit
Result

Truth table

X Y X XOR Y
0 0 0
0 1 1
1 0 1
1 1 0

Inference: Both of the inputs should be different from each other for result to be true.
 6. NOT GATE
Aim: To visualize NOT gate.
Parts used: IC Type 7404 NOT gate

Circuit
Result

Truth table

X NOT X
0 1
1 0

Inference: If the input is true the result is false and vice versa.
 TASK-2: Response of Logic Gates

Aim: To observe the pulse response of logic gates.

Software used: ORCAD(Capture CIS lite)

1. First Circuit
Aim: To visualize the given circuit.
Parts used: NAND gate, NOR gate, XOR gate
Circuit

Result
Truth table

A B C D E
0 0 1 1 0

0 1 0 1 1

1 0 0 1 1

1 1 0 0 0

Boolean Expression
The above circuit can be shown by the following Boolean expressions:
C = NOT(A OR B)
D = NOT(A AND B)
E = C XOR D
 2. Second Circuit
Aim: To visualize the given circuit.
Parts used: NAND gate
Circuit

Result
Truth table

A B C D
0 0 1 1

0 1 0 1

1 0 1 0

1 1 0 1

Boolean Expression
The above circuit can be shown by the following Boolean expressions:
C = NOT(B)
D = NOT(A AND C)
 TASK-3: Propagation Delay in Logic Gates

Aim: To measure the propagation delay of logic gates.

Software used: ORCAD(Capture CIS lite)

Circuit
Result

Truth table

A B

0 0

1 1

Inference: The output is the same as input when using 6 inverters, but there is a time
delay between input and output.
TASK-4: Implementing logic gates and simplifying Boolean functions

Aim: To simulate the given circuits and write truth table and Boolean expression for
each.
Software used: ORCAD(Capture CIS lite)

1. First Circuit
Aim: To visualize the given circuit.
Parts used: NAND gate

Circuit
Result
Truth table
X1 X2 Y
0 0 0
0 1 1
1 0 1
1 1 1

Boolean Expression:
The Boolean expression of the given circuit can be simplified into:
Y = X1 OR X2,
that is, we can simplify the given circuit of three gates into a circuit of one gate.

Inference: The given circuit performs as an OR gate i.e., output is true if one of the
inputs is true.
 2. Second Circuit
Aim: To visualize the given circuit.
Parts used: NAND gate

Circuit

Result
Truth table

X1 Y
0 1
1 0

Boolean Expression:
The Boolean expression of the given circuit can be simplified into:
Y = NOT(X1),
that is, we can simplify the given circuit of two inputs into a circuit of one input.

Inference: The given circuit performs as an INVERTOR i.e.; output is true if input is false
and vice versa.
 3. Third Circuit
Aim: To visualize the given circuit.
Parts used: XOR gate

Circuit

Result
Truth table

X1 X2 Y
0 0 0
0 1 1
1 0 0
1 1 1

Boolean Expression:
The Boolean expression of the given circuit can be simplified into:
Y = X2,
Since, (X1 xor X1 = 0) and (X2 xor 0 = X2).
that is, we can simplify the given circuit of two gates into a circuit of one input.

Inference: The given circuit performs as a BUFFER for X2 i.e.; output is what value is
supplied into X2.
 4. Fourth Circuit
Aim: To visualize the given circuit.
Parts used: NAND gate

Circuit

Result
Truth table

X1 X2 Y
0 0 0
0 1 0
1 0 0
1 1 1

Boolean Expression:
The Boolean expression of the given circuit can be simplified into:
Y = X1 AND X2,
From complementary law i.e NOT(NOT(A)) = A.
that is, we can simplify the given circuit of three gate into a circuit of two gates.

Inference: The given circuit performs as an AND gate i.e.; output is true if both inputs
are true.
 5. Fifth Circuit
Aim: To visualize the given circuit.
Parts used: AND gate, NOR gate.

Circuit
Result

Truth table

X1 X2 Y2 Y1
0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 0

Boolean Expression:
The Boolean expression of the given circuit can be simplified into:
Y2 = X1 XOR X2,
that is, we can simplify Y2 into a Boolean function using two gates.

Inference: In the given circuit Y2 performs as an XOR gate i.e.; output is true if both
inputs are different.
 TASK-5: Burglar Alarm

Aim: To simulate burglar alarm for a car.

Software used: ORCAD(Capture CIS lite)
Parts used: NOR gate, AND gate

Q) A burglar alarm for a car has a normally low switch on each of four doors. If
any door is opened the output of that switch goes HIGH. The alarm is set off
with an active-LOW output signal. What type of gate will provide this logic?
Support your answer with an explanation.
Solution
We will use NOR gate to implement such system, and when alarm is set off (i.e. signal
becomes high) the output signal is low, and in other cases when alarm is not set off the
output signal will be high.

Circuit
Result
Truth table

A B C D E
0 0 0 0 1
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
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

Boolean expression
The Boolean expression for the burglar alarm looks like,
E = NOT(A OR B OR C OR D), which can be broken down into two expressions using De
Morgan’s law, so,
E = NOT(A OR B) AND NOT(C OR D)

Inference: Only when all values are false (low voltage), will the alarm not set off i.e.
output is true, otherwise the alarm with set off and output will be false.
Name: Sudarshan Bhatta

Regd. No: 20BCE2919

Course: Digital Logic and Design - ELA

Experiment-2: Boolean Algebra

OBJECTIVE:
• To verify the rules and regulations of Boolean Algebra
• To simplify and modify Boolean logic functions by means of DE Morgan’s
theorem.
• To design and implement a logic circuit

APPARATUS:
− PB-503
− 7400 Quadruple 2 input NAND gates.
− 7402 Quadruple 2 input NOR gates
− 7408 Quadruple 2 input AND gates
− 7432 Quadruple 2 input OR gates
− 7404 Hex inverters
− 7411 Triple 3-input AND gate
THEORY:
1. A+0 = A
2. A+1 = 1
3. A .0 = 0
4. A .1 = A
5. A+A = A
6. A+A’ = 1
7. A.A = A
8. A.A’ = 0
9. (A’)’ = A
10. A+AB = A
11. A+A’B = A+B
12. (A+B)(A+C) = A+BC
13. A’. B’ = (A+B)’
14. A’+B’ = (A.B)’
 TASK-1: Boolean Theorem

Aim: To verify the rules and regulations of Boolean Algebra.

Software used: ORCAD (Capture CIS lite)

a. Identity Rule 1: A + 0 = A
Aim: To prove identity rule of Boolean algebra.
Parts used: OR gate.

Circuit
Result

Truth table

X Y Z

0 0 0

1 0 1

Inference: From the above truth table we can say that

X + 0 = X, as Z = X when Y = 0.
Hence, rule 1 is verified.
 b. Idempotent rule: A AND A = A
Aim: To prove idempotent rule of Boolean algebra.
Parts used: AND gate.

Circuit

Result
Truth table

X Y

0 0

1 1

Inference: From the above truth table we can say that

X AND X= X, as Y = X when Y = 0.
Hence, the given circuit verifies rule 7 i.e. A.A = A.
 c. Rule 10 (Absorption rule): A + B.A = A
Aim: To prove idempotent rule of Boolean algebra.
Parts used: AND gate, OR gate.

Circuit

Result
Truth table

A B C = A + A. B

0 0 0

0 1 0

1 0 1

1 1 1

Inference: From the above truth table we can say that C = A,

Hence, the given circuit verifies rule 10 i.e. A + A.B = A.
 d. Rule 8 (Complementarity): A + A’ = 1, Dual A.A’ = 0
Aim: To prove idempotent rule of Boolean algebra.
Parts used: INVERTOR, OR gate.

Circuit

Result
Truth table

A B(A`) C

0 1 0

0 1 0

1 0 0

1 0 0

Inference: From the above truth table we can say that A.A’= 0,
So, A.A’ could be replaced with a wire to ground i.e., low voltage (0).
 e. Rule 11 states that A+A’B = A+B
Aim: To prove rule/theorem 11.
Parts used: INVERTOR, OR gate, AND gate.

Circuit

Result
Truth table

A B C = A + A’ B D=A+B

0 0 0 0

0 1 1 1

1 0 1 1

1 1 1 1

Inference: From the above truth table we can say that A + A’ B = A + B,

Hence, rule 11 is verified.
 TASK-2: De Morgan’s Theorem

Aim: To verify both forms of De Morgan’s.

Software used: ORCAD (Capture CIS lite)

a. First equation
Aim: To verify the first equation i.e., F = A + B = (A’. B’)’.
Parts used: OR gate, NAND gate, INVERTER.

Circuit
Result

Truth table

A B C = (A’ B’)’ D=A+B

0 0 0 0

0 1 1 1

1 0 1 1

1 1 1 1

Inference: From the above truth table we can say that C = D, i.e. (A’ B’)’ = A + B,
So, first equation of De Morgan’s theorem is verified.
 b. First equation
Aim: To verify the first equation i.e., F = A.B = (A’ + B’)’.
Parts used: AND gate, NOR gate, INVERTER.

Circuit

Result
Truth table

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

0 0 0 0

0 1 0 0

1 0 0 0

1 1 1 1

Inference: From the above truth table we can say that C = D, i.e. (A’ + B’)’ = A.B,
So, second equation of De Morgan’s theorem is verified.
 TASK-3: Design of a Digital Circuit

Aim: To design and implement a digital circuit.

Software used: ORCAD (Capture CIS lite)
Parts used: OR gate, AND gate, INVERTORS

Q) Four chairs A, B, C, and D are placed in a row. Each chair may be occupied (“l”) or
empty (“0”). A Boolean function F is “l” if and only if there are two or more adjacent
chairs that are empty.
1. Give the truth table defining the Boolean function F
2. Express F as a minterm expansion (standard sum of product)
3. Express F as a maxterm expansion (standard product of sum)
4. Using postulates and theorems of Boolean algebra, simplify the minterm
expansion of F to a form with as few occurrences of each as possible.
5. Implement on LogicWorks for the pre-lab and then on PB-503, the simplified
Boolean function with logic gates and check the operation of the circuit.
Solution
The given problem has a truth table of:
 1) Truth table of the given circuit is:

A B C D F
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0

Using K-map for four literals we get:

AB CD 00 01 11 10

00 1 1 1 1

01 1 0 0 0

11 1 0 0 0

10 1 1 0 0
Grouping can be done in this way:

Solving the obtained K-map, we get the following expressions for the Boolean function
‘F’:
F = A’ B’ + C’ D’ + B’ C’

So,
2) Minterm expansion (sum of products) is,
F = ∑m (0, 1, 2, 3, 4, 8, 9, 12)
F = A'.B'.C'.D' + A'.B'.C'.D + A'.B'.C.D' + A'.B'.C.D + A'.B.C'.D' +
A.B'.C'.D' + A.B'.C'.D + A.B.C'.D'
3) Maxterm expansion (standard product of sum) is,
F = π (5, 6, 7, 10, 11, 13, 14, 15)
F = (A+B'+C+D') . (A+B'+C'+D) . (A+B'+C'+D') . (A'+B+C'+D) .
(A'+B+C'+D') . (A'+B'+C+D') . (A'+B'+C'+D) . (A'+B'+C'+D')

4) The simplified Boolean expression is obtained from the K-map i.e.

F = A’ B’ + C’ D’ + B’ C’
 5) Implementation of the simplified Boolean function is:

Circuit
Result

Inference: Using K-maps we were able to simplify a function of at least ‘eight’ sums of
products to a function of only ‘three’ sums of products i.e.
F = A’ B’ + C’ D’ + B’ C’
Hence, using theorems of Boolean algebra we were able to implement our own circuit.