Digital Microprocessor Lab Final
Digital Microprocessor Lab Final
EX. NO.: 1
VERIFICATION OF LOGIC GATES
DATE:
AIM:
To construct the logic circuit using IC’s and to verify their truth tables.
MATERIALS REQUIRED:
Trainer kit, IC 7408 (AND), IC 7432 (OR), IC 7404 (NOT), IC 7400 (NAND),
IC 7402 (NOR), IC (7486) EX-OR, voltmeter, connecting wires, etc.
FORMULA:
OR Gate: Y = A+B
NOT Gate: Y = A
EX-OR Gate: Y = A ⨁ B
Where,
A, B = Inputs, Y= Output
PROCEDURE:
Place the IC on trainer kit connects Vcc and ground to respective pins of IC trainer kit.
Connect the inputs to the input switched provided in the trainer kit.
Connect the outputs to the switches provided in the o/p LEDs.
Apply various combinations of inputs according the truth table and observe condition
of LEDs.
Disconnect output from the LEDs and note down the corresponding multimeter
voltages for various combination of inputs
2
SYMBOL: SYMBOL:
0 0 0 0 0 0
0 1 0 0 1 1
1 0 0 1 0 1
1 1 1 1 1 1
3
SYMBOL: SYMBOL:
0 1 1
0 1
1 0 1
1 0
1 1 1
4
SYMBOL: SYMBOL:
0 0 1 0 0 0
0 1 0 0 1 1
1 0 0 1 0 1
1 1 0 1 1 0
RESULT:
The logic gates are constructed using IC’s and their truth tables are verified.
*******
5
EX. NO.: 2
CONSTRUCTION OF HALF ADDER AND FULL ADDER
DATE:
AIM:
To construct the half adder and full adder logic circuits by using Ex-OR and basic
gates and to verify their truth tables.
MATERIALS REQUIRED:
Trainer kit,
IC 7486 (EX-OR),
IC 7408 (AND),
IC 7432 (OR),
Connecting wires.
PROCEDURE:
CIRCUIT DIAGRAM:
TRUTH TABLE:
INPUT OUTPUT
A B SUM CARRY
(A⨁ B) (A.B)
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
7
FULL ADDER:-
CIRCUIT DIAGRAM:
8
TRUTH TABLE:
INPUT OUTPUT
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
RESULT:
The HALF adder and FULL adder logic circuits are constructed by using EX-OR and
basic gates and verified their truth tables.
*******
9
EX. NO.: 3
K- MAP
DATE:
AIM:
To simplify the given Boolean expression by using k-map and to construct the circuit
for given Boolean expression and simplified Boolean expression and to verify outputs.
MATERIALS REQUIRED:
Trainer kit,
IC 7404 (NOT),
IC 7408 (AND),
IC 7432 (OR),
Connecting wires.
PROCEDURE:
BOOLEAN EXPRESSION:-
Y=AC+ A B + BC + AC
11
K – MAP:-
SUM OF PRODUCT:
Y=AC+ A B + BC + AC
BC BC BC BC
A
1
A 1 1 1
1
Simplified Expression :
Y=A C+ A B + BC + AC
Y = A+ BC
Y = A+ BC
12
TRUTH TABLE:
INPUT OUTPUT
0 0 0 0 0
0 0 1 1 1
0 1 0 0 0
0 1 1 0 0
1 0 0 1 1
1 0 1 1 1
1 1 0 1 1
1 1 1 1 1
RESULT:
The given Boolean expression is simplified by using k-map and the circuit are
constructed and outputs are verified.
*******
13
EX. NO.: 4
SHIFT REGISTER
DATE:
AIM:
To construct the shift register by using IC 7495 and verify the following modes
MATERIALS REQUIRED:
Trainer kit,
IC 7495,
Connecting wires.
PROCEDURE:
Connections are made as per circuit diagram. Load the shift register with 5
bits data one by one serially.
At the end of 4th clock pulse the first data ‘do’ appears at QD.
Apply another clock pulse the second data d appears at QD.
Apply another clock pulse the third data d2 appears at QD.
Application of next clock pulse will enable the 4th data d3 to appear at QD,
thus the data applied serially input come out serially.
PISO:-
17
RESULT:
The shift register are constructed by using IC 7495 and verified the following modes
*******
18
EX. NO.: 5
UP – DOWN COUNTER
DATE:
AIM:
To construct up-down counter by using IC 7490, IC 7404 and to verify its truth tables.
MATERIALS REQUIRED:
Trainer kit,
IC 7490,
IC 7404,
Connecting wires.
PROCEDURE:
Connections are made as per circuit diagram. Load the shift register with 5
bits data one by one serially.
Clock pulses are applied one by one at the clock inputs and outputs is
observed at QA, QB, QC and QD for IC 7490.
Truth table is verified, now connect the output of the NOT gate to the load
input. Clock pulses are applied to “count” pins, the truth table is verified.
19
UP COUNTER:-
CIRCUIT DIAGRAM:
TRUTH TABLE:
UP INPUT OUTPUT
COUNT CLK QC QB QA
0 1 0 0 0
1 1 0 0 1
2 1 0 1 0
3 1 0 1 1
4 1 1 0 0
5 1 1 0 1
6 1 0 1 0
7 1 1 1 1
20
DOWN COUNTER:-
CIRCUIT DIAGRAM:
TRUTH TABLE:
INPUT OUTPUT
DOWN
COUNT
CLK QC QB QA
7 1 1 1 1
6 1 1 1 0
5 1 1 0 1
4 1 1 0 0
3 1 0 1 1
2 1 0 1 0
1 1 0 0 1
0 1 0 0 0
RESULT:
The Up-Down counter was constructed by using IC 7490, IC 7404 and verified its truth
tables.
*******
21
FLOW CHART:
START
NO If
Carry =
?
YES
Increment register C
STOP
22
EX. NO.: 6
EIGHT BIT ADDITION AND SUBTRACTION
DATE:
AIM:
To write and execute an assembly language program for addition and subtraction of two
eight bit numbers.
(i) ADDITION:-
INPUT:
ADDRESS DATA
8100
8101
OUTPUT:
ADDRESS DATA
8102
(SUM)
8103
(CARRY)
24
HAND CALCULATION:
25
FLOW CHART:
START
STOP
(ii) SUBTRACTION:
26
PROGRAM:
TABULATION:-
27
INPUT:
ADDRESS DATA
8100
8101
OUTPUT:
ADDRESS DATA
8102
HAND CALCULATION:
28
RESULT:
Thus an assembly language program for addition and subtraction of two 8-bit
numbers are written and executed.
*******
FLOW CHART:
START
Initialize reg. B = 00
29
Initialize reg. A = 00
NO
If Carry =?
Increment register B
Decrement register C
NO
If Zero = ?
YES
EX. NO.: 7
STOP
SUM OF SERIES
DATE:
30
AIM:
OP-
ADDRESS LABEL MNEMONICS OPERAND COMMENTS
CODE
8000 MVI B, 00h 06, 00 Initialize reg. B with 00.
800E
800E DCR C 0D Decrement counter.
(LOOP1)
8008 Jump to address 8008 if
800F JNZ C2, 08, 80
(LOOP2) the counter is non zero.
TABULATION:-
INPUT:
31
ADDRESS DATA
8100 04
(No. of Count)
8101
8102
8103
8104
OUTPUT:
ADDRESS DATA
8105
(SUM)
8106
(CARRY)
HAND CALCULATION:
32
RESULT:
*******
FLOW CHART:
33
START
Decrement counter
NO
If
Zero =
?
YES
STOP
EX. NO.: 8
DATA TRANSFER
DATE:
34
AIM:
To write and execute an assembly language program to move the given set of numbers
from one set of memory location to another set of memory location.
PROGRAM:
TABULATION:-
INPUT:
35
ADDRESS DATA
0A
8100
(No. of Count)
8101
8102
8103
8104
8105
8106
8107
8108
8109
810A
TABULATION:-
OUTPUT:
36
ADDRESS DATA
8201
8202
8203
8204
8205
8206
8207
8208
8209
820A
RESULT:
Thus an assembly language program for data transferred from one set of memory
location to another set of memory location is written and executed.
*******
FLOW CHART:
START
Decrement register C
NO
If
Carry = ?
YES
Decrement counter
NO
If
Zero = ?
YES
AIM:
38
To write and execute an assembly language program to fine the result of maximum of
“N” numbers and the result store in one memory location.
PROGRAM:
8007
8007 INX H 23 Increment H-L pair.
(LOOP)
Compare memory with
8008 CMP M 8E
accumulator.
800D Jump to address 800D
8009 JNC D2, 0D, 80
(AHEAD) if there is no carry.
Move the content to
800C MOV A, M 7E
reg. A.
800D
800D DCR C 0D Decrement counter.
(AHEAD)
8007 Jump to address 8007
800E JNZ C2, 07, 80
(LOOP) if there is non zero.
Store the result in
8011 STA 8200h 32, 00, 82
memory address.
TABULATION:-
INPUT:
ADDRESS DATA
39
0C
8100
(No. of Count)
8101
8102
8103
8104
8105
8106
8107
8108
8109
810A
810B
810C
810D
OUTPUT:
40
ADDRESS DATA
8200
RESULT:
Thus an assembly language program for data transferred from one set of memory
location to another set of memory location is written and executed.
*******
FLOW CHART:
START
41
Load H-L pair with address of first operand’s memory location
AIM:
FLOW CHART:
43
Initialize 00 with register A
Decrement register D
NO If
Zero =
?
YES
Add register C with accumulator
STOP
TABULATION:-
INPUT:
ADDRESS DATA
8100
44
OUTPUT:
ADDRESS DATA
8200
HAND CALCULATION:
RESULT:
*******