KONGU ENGINEERING COLLEGE

(Autonomous)
PERUNDURAI,ERODE-638060

Department of Computer Technology-UG

14BCC51 MICROPROCESSORS
1.INTRODUCTION TO 8085
2a.8 BIT DATA ADDITION
2b.8 BIT DATA SUBTRACTION
3a.8 BIT DATA MULTIPLICATION
3b.8 BIT DIVISION
4a.16 BIT DATA ADDITION
4b.16 BIT DATA SUBTRACTION
5a. 16 BIT DATA MULTIPLICATION
5a.16 BIT DATA DIVISION
6a.FINDING LARGEST ELEMENT IN AN ARRAY
6b.FINDING SMALLEST ELEMENT IN AN ARRAY
7a.SORTING IN ASCENDING ORDER
7b.SORTING IN DESCENDING ORDER
8a.CODE CONVERSION –DECIMAL TO HEX
8b.CODE CONVERSION –HEXADECIMAL TO DECIMAL
9a.BCD ADDITION
9b.BCD SUBTRACTION
10.SEARCHING AN ELEMENT IN AN ARRAY

2
 1. INTRODUCTION TO 8085

INTEL 8085 is one of the most popular 8-bit microprocessor capable of

addressing 64 KB of memory and its architecture is simple. The device has 40 pins,
requires +5 V power supply and can operate with 3MHz single phase clock.

ALU (Arithmetic Logic Unit):

The 8085A has a simple 8-bit ALU and it works in coordination with the
accumulator, temporary registers, 5 flags and arithmetic and logic circuits. ALU has
the capability of performing several mathematical and logical operations. The
temporary registers are used to hold the data during an arithmetic and logic operation.
The result is stored in the accumulator and the flags are set or reset according to the
result of the operation. The flags are affected by the arithmetic and logic operation.
They are as follows:
 Sign flag
After the execution of the arithmetic - logic operation if the bit D7
of the result is 1, the sign flag is set. This flag is used with signed
numbers. If it is 1, it is a negative number and if it is 0, it is a positive
number.
 Zero flag
The zero flag is set if the ALU operation results in zero. This flag
is modified by the result in the accumulator as well as in other registers.
 Auxillary carry flag
In an arithmetic operation when a carry is generated by digit D3
and passed on to D4, the auxillary flag is set.
 Parity flag
After arithmetic – logic operation, if the result has an even number
of 1’s the flag is set. If it has odd number of 1’s it is reset.
 Carry flag
If an arithmetic operation results in a carry, the carry flag is set.
The carry flag also serves as a borrow flag for subtraction.

3
Timing and control unit
This unit synchronizes all the microprocessor operation with a clock and
generates the control signals necessary for communication between the
microprocessor and peripherals. The control signals RD (read) and WR (write)
indicate the availability of data on the data bus.

Instruction register and decoder

The instruction register and decoder are part of the ALU. When an instruction is
fetched from memory it is loaded in the instruction register. The decoder decodes the
instruction and establishes the sequence of events to follow.

Register array
The 8085 has six general purpose registers to store 8-bit data during program
execution. These registers are identified as B, C, D, E, H and L. they can be combined
as BC, DE and HL to perform 16-bit operation.

Accumulator
Accumulator is an 8-bit register that is part of the ALU. This register is used to
store 8-bit data and to perform arithmetic and logic operation. The result of an
operation is stored in the accumulator.

Program counter
The program counter is a 16-bit register used to point to the memory address of
the next instruction to be executed.

Stack pointer
It is a 16-bit register which points to the memory location in R/W memory, called
the Stack.

4
Communication lines
8085 microprocessor performs data transfer operations using three communication
lines called buses. They are address bus, data bus and control bus.
 Address bus – it is a group of 16-bit lines generally identified as A0 – A15.
The address bus is unidirectional i.e., the bits flow in one direction from
microprocessor to the peripheral devices. It is capable of addressing 2 16
memory locations.
 Data bus – it is a group of 8 lines used for data flow and it is bidirectional.
The data ranges from 00 – FF.
 Control bus – it consist of various single lines that carry synchronizing
signals. The microprocessor uses such signals for timing purpose.

5
 2(A). 8 BIT DATA ADDITION

AIM:

To add two 8 bit numbers stored at consecutive memory locations.

ALGORITHM:

1. Initialize memory pointer to data location.

2. Get the first number from memory in accumulator.
3. Get the second number and add it to the accumulator.
4. Store the answer at another memory location.

6
FLOW CHART:

START

[C] 00H

[HL] 4500H

[A] [M]

[HL][HL]+1

[A][A]+[M]

NO

Is there a
YES
Carry ?

[C][C]+1

[HL][HL]+1

[M] [A]

[HL][HL]+1

[M] [C]

STOP

7
PROGRAM:

ADDRESS OPCODE LABEL MNEMONICS OPERAND COMMENT

4100 START MVI C, 00 Clear C reg.
4101
4102 LXI H, 4500 Initialize HL reg. to
4103 4500
4104
4105 MOV A, M Transfer first data to
accumulator
4106 INX H Increment HL reg. to
point next memory
Location.
4107 ADD M Add first number to
acc. Content.
4108 JNC L1 Jump to location if
4109 result does not yield
410A carry.
410B INR C Increment C reg.
410C L1 INX H Increment HL reg. to
point next memory
Location.
410D MOV M, A Transfer the result from
acc. to memory.
410E INX H Increment HL reg. to
point next memory
Location.
410F MOV M, C Move carry to memory
4110 HLT Stop the program

OBSERVATION:

INPUT OUTPUT
4500 4502
4501 4503

RESULT:

Thus the 8 bit numbers stored at 4500 &4501 are added and the result stored at 4502 &
4503.

8
 2(B). 8 BIT DATA SUBTRACTION

AIM:

To Subtract two 8 bit numbers stored at consecutive memory locations.

ALGORITHM:

1. Initialize memory pointer to data location.

2. Get the first number from memory in accumulator.
3. Get the second number and subtract from the accumulator.
4. If the result yields a borrow, the content of the acc. is complemented and 01H is
added to it (2’s complement). A register is cleared and the content of that reg. is
incremented in case there is a borrow. If there is no borrow the content of the acc.
is directly taken as the result.
5. Store the answer at next memory location.

9
FLOW CHART:
START

[C] 00H

[HL] 4500H

[A] [M]

[HL][HL]+1

[A][A]-[M]

Is there a NO

Borrow ?
YES

Complement [A]
Add 01H to [A]

[C][C]+1

[HL][HL]+1

[M] [A]

[HL][HL]+1

[M] [C]
PROGRAM:

STOP
10
ADDRESS OPCODE LABEL MNEMONICS OPERAND COMMENT
4100 START MVI C, 00 Clear C reg.
4102
4102 LXI H, 4500 Initialize HL reg. to
4103 4500
4104
4105 MOV A, M Transfer first data to
accumulator
4106 INX H Increment HL reg. to
point next mem.
Location.
4107 SUB M Subtract first number
from acc. Content.
4108 JNC L1 Jump to location if
4109 result does not yield
410A borrow.
410B INR C Increment C reg.
410C CMA Complement the Acc.
content
410D ADI 01H Add 01H to content of
410E acc.
410F L1 INX H Increment HL reg. to
point next mem.
Location.
4110 MOV M, A Transfer the result from
acc. to memory.
4111 INX H Increment HL reg. to
point next mem.
Location.
4112 MOV M, C Move carry to mem.
4113 HLT Stop the program

OBSERVATION:

INPUT OUTPUT
4500 4502
4501 4503

RESULT:
Thus the 8 bit numbers stored at 4500 &4501 are subtracted and the result stored at 4502
& 4503.

11
 3(A). 8 BIT DATA MULTIPLICATION

AIM:

To multiply two 8 bit numbers stored at consecutive memory locations and store
the result in memory.

ALGORITHM:

LOGIC: Multiplication can be done by repeated addition.

1. Initialize memory pointer to data location.

2. Move multiplicand to a register.
3. Move the multiplier to another register.
4. Clear the accumulator.
5. Add multiplicand to accumulator
6. Decrement multiplier
7. Repeat step 5 till multiplier comes to zero.
8. The result, which is in the accumulator, is stored in a memory location.

12
FLOW CHART:

START

[HL] 4500

B M

[HL]  [HL]+1

A  00

C  00

[A]  [A] +[M]

Is there NO
any
carry

YES
C  C+1

B  B-1

NO
IS
B=0
YES

13
 A

[HL][HL]+1

[M] [A]

[HL][HL]+1

[M] [C]

STOP

PROGRAM:

ADDRESS OPCODE LABEL MNEMONICS OPERAND COMMENT

4100 START LXI H, 4500 Initialize HL reg. to
4101 4500
4102
4103 MOV B, M Transfer first data to
reg. B
4104 INX H Increment HL reg. to
point next mem.
Location.
4105 MVI A, 00H Clear the acc.
4106
4107 MVI C, 00H Clear C reg for carry
4108

4109 L1 ADD M Add multiplicand

multiplier times.
410A JNC NEXT Jump to NEXT if there
410B is no carry
410C
410D INR C Increment C reg
410E NEXT DCR B Decrement B reg
410F JNZ L1 Jump to L1 if B is not
4110 zero.

14
 4111
4112 INX H Increment HL reg. to
point next mem.
Location.
4113 MOV M, A Transfer the result from
acc. to memory.
4114 INX H Increment HL reg. to
point next mem.
Location.
4115 MOV M, C Transfer the result from
C reg. to memory.
4116 HLT Stop the program

OBSERVATION:

INPUT OUTPUT
4500 4502
4501 4503

RESULT:

Thus the 8-bit multiplication was done in 8085p using repeated addition method.

15
 3(B). 8 BIT DIVISION

AIM:

To divide two 8-bit numbers and store the result in memory.

ALGORITHM:

LOGIC: Division is done using the method Repeated subtraction.

1. Load Divisor and Dividend
2. Subtract divisor from dividend
3. Count the number of times of subtraction which equals the quotient
4. Stop subtraction when the dividend is less than the divisor .The dividend now
becomes the remainder. Otherwise go to step 2.
5. stop the program execution.

16
FLOWCHART:
START

B  00

[HL] 4500

A M

[HL]  [HL]+1

M  A-M

[B]  [B] +1

NO
IS A<0
YES
A  A+ M

B  B-1

[HL][HL]+1

[M] [A]

[HL][HL]+1

[M] [B]

STOP
17
PROGRAM:

ADDRESS OPCODE LABEL MNEMO OPERA COMMENTS

NICS ND
4100 MVI B,00 Clear B reg for quotient
4101
4102 LXI H,4500 Initialize HL reg. to
4103 4500H
4104
4105 MOV A,M Transfer dividend to acc.
4106 INX H Increment HL reg. to point
next mem. Location.
4107 LOOP SUB M Subtract divisor from dividend
4108 INR B Increment B reg
4109 JNC LOOP Jump to LOOP if result does
410A not yield borrow
410B
410C ADD M Add divisor to acc.
410D DCR B Decrement B reg
410E INX H Increment HL reg. to point
next mem. Location.
410F MOV M,A Transfer the remainder from
acc. to memory.
4110 INX H Increment HL reg. to point
next mem. Location.
4111 MOV M,B Transfer the quotient from B
reg. to memory.
4112 HLT Stop the program

OBSERVATION:

S.NO INPUT OUTPUT

ADDRESS DATA ADDRESS DATA
1 4500 4502
4501 4503
2 4500 4502
4501 4503

RESULT:

Thus an ALP was written for 8-bit division using repeated subtraction method and
executed using 8085 p kits

18
 4(A). 16 BIT DATA ADDITION

AIM:

To add two 16-bit numbers stored at consecutive memory locations.

ALGORITHM:

1. Initialize memory pointer to data location.

2. Get the first number from memory and store in Register pair.
3. Get the second number in memory and add it to the Register pair.
4. Store the sum & carry in separate memory locations.

19
FLOW CHART:
START

[L] [8050 H]
[H] [8051 H]

[DE] [HL]

[L] [8052H]
[H] [8053H]

[A]00H

[HL][HL]+[DE]

NO
Is there a
Carry?

YES
[A][A]+1

[8054][ L]

[8055] [H]

[8056] [A]

STOP

20
PROGRAM:

ADDRESS OPCODE LABEL MNEMONICS OPERAND COMMENT

8000 START LHLD 8050H Load the augend in DE
8001 pair through HL pair.
8002
8003 XCHG
8004 LHLD 8052H Load the addend in HL
8005 pair.
8006
8007 MVI A, 00H Initialize reg. A for
8008 carry
8009 DAD D Add the contents of HL
Pair with that of DE
pair.
800A JNC LOOP If there is no carry, go
800B to the instruction
800C labeled LOOP.
800D INR A Otherwise increment
reg. A
800E LOOP SHLD 8054H Store the content of HL
800F Pair in 8054H(LSB of
8010 sum)
8011 STA 8056H Store the carry in
8012 8056H through Acc.
8013 (MSB of sum).
8014 HLT Stop the program.

OBSERVATION:

INPUT OUTPUT
ADDRESS DATA ADDRESS DATA
8050H 8054H
8051H 8055H
8052H 8056H
8053H

RESULT:

Thus an ALP program for 16-bit addition was written and executed in 8085p
using special instructions.

21
 4(B). 16 BIT DATA SUBTRACTION

AIM:

To subtract two 16-bit numbers stored at consecutive memory locations.

ALGORITHM:

1. Initialize memory pointer to data location.

2. Get the subtrahend from memory and transfer it to register pair.
3. Get the minuend from memory and store it in another register pair.
4. Subtract subtrahend from minuend.
5. Store the difference and borrow in different memory locations.

22
 FLOW CHART:

START

[L] [8050 H]
[H] [8051 H]

[DE] [HL]

[L] [8052H]
[H] [8053H]

[HL][HL]-[DE]

Is there a NO
borrow?

YES
[C][C]+1

[8054][ L]

[8055] [H]

[8056] [C]

STOP

PROGRAM:
ADDRESS OPCODE LABEL MNEMO OPER COMMENTS
NICS AND
8000 START MVI C, 00 Initialize C reg.
8001
8002 LHLD 8050H

23
8003 Load the subtrahend in DE
8004 reg. Pair through HL reg.
8005 XCHG pair.
8006 LHLD 8052H Load the minuend in HL reg.
8007 Pair.
8008
8009 MOV A, L Move the content of reg. L to
Acc.
800A SUB E Subtract the content of reg.
E from that of acc.
800B MOV L, A Move the content of Acc. to
reg. L
800C MOV A, H Move the content of reg. H
to Acc.
800D SBB D Subtract content of reg. D
with that of Acc.
800E MOV H, A Transfer content of acc. to
reg. H
800F SHLD 8054H Store the content of HL pair
8010 in memory location 8504H.
8011
8012 JNC NEXT If there is borrow, go to the
8013 instruction labeled NEXT.
8014
8015 INR C Increment reg. C
8016 NEXT MOV A, C Transfer the content of reg. C
to Acc.
8017 STA 8056H Store the content of acc. to
8018 the memory location 8506H
8019
801A HLT Stop the program execution.

OBSERVATION:
INPUT OUTPUT
ADDRESS DATA ADDRESS DATA
8050H 8054H
8051H 8055H
8052H 8056H
8053H

RESULT:

Thus an ALP program for subtracting two 16-bit numbers was written and
executed.

24
 5(A). 16 BIT MULTIPLICATION

AIM:

To multiply two 16 bit numbers and store the result in memory.

ALGORITHM:

1. Get the multiplier and multiplicand.

2. Initialize a register to store partial product.
3. Add multiplicand, multiplier times.
4. Store the result in consecutive memory locations.

25
FLOWCHART:

START

L [8050]
H [8051]

SP HL

L [8052]
H [8053]

DE HL

HL0000
BC0000

HLHL+SP

NO
Is Carry
flag set?

YES

BCBC+1

DEDE+1

NO
Is Zero
flag set?
YES

A 26
 A

[8054] L
[8055] H

[8056] C
[8057] B

STOP

27
ADDRESS OPCODE LABEL MNEM OPERAN COMMENTS
ONICS D
8000 START LHLD 8050 Load the first No. in stack pointer
8001 through HL reg. pair
8002
8003 SPHL
8004 LHLD 8052 Load the second No. in HL reg.
8005 pair
8006 & Exchange with DE reg. pair.
8007 XCHG
8008 LXI H, 0000H
8009
800A Clear HL & DE reg. pairs.
800B LXI B, 0000H
800C
800D
800E LOOP DAD SP Add SP with HL pair.
800F JNC NEXT If there is no carry, go to the
8010 instruction labeled NEXT
8011
8012 INX B Increment BC reg. pair
8013 NEXT DCX D Decrement DE reg. pair.
8014 MOV A,E Move the content of reg. E to Acc.
8015 ORA D OR Acc. with D reg.
8016 JNZ LOOP If there is no zero, go to
8017 instruction labeled LOOP
8018
8019 SHLD 8054 Store the content of HL pair in
801A memory locations 8054 & 8055.
801B
801C MOV A, C Move the content of reg. C to Acc.
801D STA 8056 Store the content of Acc. in
801E memory location 8056.
801F
8020 MOV A, B Move the content of reg. B to Acc.
8021 STA 8057 Store the content of Acc. in
8022 memory location 8056.
8023
8024 HLT Stop program execution
OBSERVATION:
INPUT OUTPUT
ADDRESS DATA ADDRESS DATA
8050 8054
8051 8055
8052 8056
8053 8057

28
RESULT:

Thus the 16-bit multiplication was done in 8085p using repeated addition
method.

29
 5(B). 16- BIT DIVISION

AIM:

To divide two 16-bit numbers and store the result in memory using 8085
mnemonics.

ALGORITHM:

1. Get the dividend and divisor.

2. Initialize the register for quotient.
3. Repeatedly subtract divisor from dividend till dividend becomes less than divisor.
4. Count the number of subtraction which equals the quotient.
5. Store the result in memory.

30
FLOWCHART:

START

L [8051]
H [8052]

HL DE

L [8050]
H [8051]

BC 0000H

A L; AA- E
LA

AH
AA- H- Borrow
HA

BCBC+ 1

NO
Is Carry
flag set ?

YES

31
 A

BCBC- 1
HLHL+DE

L[8054]
H[8055]

AC

[8056] A

AB

[8057] A

STOP

PROGRAM:
ADDRESS OPCODE LABEL MNEM OPERA COMMENTS
ONICS ND
8000 START LHLD 8052 Load the first No. in stack pointer
8001 through HL reg. pair
8002
8003 XCHG
8004 LHLD 8050 Load the second No. in HL reg. pair
8005 & Exchange with DE reg. pair.
8006
8007 LXI B, 0000H
8008 Clear BC reg. pair.
8009
800A LOOP MOV A, L Move the content of reg. L to Acc.
800B SUB E Subtract reg. E from that of Acc.

32
800C MOV L, A Move the content of Acc to L.
800D MOV A, H Move the content of reg. H Acc.
800E SBB D Subtract reg. D from that of Acc.
800F MOV H, A Move the content of Acc to H.
8010 INX B Increment reg. Pair BC
8011 JNC LOOP If there is no carry, go to the location
8012 labeled LOOP.
8013
8014 DCX B Decrement BC reg. pair.
8015 DAD D Add content of HL and DE reg. pairs.
8016 SHLD 8054 Store the content of HL pair in 8054 &
8017 8055.
8018
8019 MOV A, C Move the content of reg. C to Acc.
801A STA 8056 Store the content of Acc. in memory
801B 8056
801C
801D MOV A, B Move the content of reg. B to Acc.
801E STA 8057 Store the content of Acc. in memory
801F 8057.
8020
8021 HLT Stop the program execution.

OBSERVATION:
INPUT OUTPUT
ADDRESS DATA ADDRESS DATA
8050 8054
8051 8055
8052 8056
8053 8057

RESULT:

Thus the 16-bit Division was done in 8085p using repeated subtraction method.

33
 6(A). LARGEST ELEMENT IN AN ARRAY

AIM:
To find the largest element in an array.

ALGORITHM:
1. Place all the elements of an array in the consecutive memory locations.
2. Fetch the first element from the memory location and load it in the accumulator.
3. Initialize a counter (register) with the total number of elements in an array.
4. Decrement the counter by 1.
5. Increment the memory pointer to point to the next element.
6. Compare the accumulator content with the memory content (next
element).
7. If the accumulator content is smaller, then move the memory content
(largest element) to the accumulator. Else continue.
8. Decrement the counter by 1.
9. Repeat steps 5 to 8 until the counter reaches zero
10. Store the result (accumulator content) in the specified memory location.

34
FLOW CHART:
START

[HL]  [8100H]

[B]  04H

[A]  [HL]

[HL  [HL] + 1

NO IS
[A] <
[HL]?
YES

[A] [HL]

[B]  [B]-1

IS NO
[B] =
0?
YES

[8105]  [A]

STOP

PROGRAM:

35
ADDRE OPCO LABEL MNEM OPER COMMENTS
SS DE ONICS AND
8001 LXI H,8100 Initialize HL reg. to
8002 8100H
8003
8004 MVI B,04 Initialize B reg with no. of
8005 comparisons(n-1)
8006 MOV A,M Transfer first data to acc.
8007 LOOP1 INX H Increment HL reg. to point
next memory location
8008 CMP M Compare M & A
8009 JNC LOOP If A is greater than M then go
800A to loop
800B
800C MOV A,M Transfer data from M to A reg
800D LOOP DCR B Decrement B reg
800E JNZ LOOP1 If B is not Zero go to loop1
800F
8010
8011 STA 8105 Store the result in a memory
8012 location.
8013
8014 HLT Stop the program

OBSERVATION:

INPUT OUTPUT
ADDRESS DATA ADDRESS DATA
8100 8105
8101
8102
8103
8104

RESULT:
Thus the largest number in the given array is found out.

36
 6(B). SMALLEST ELEMENT IN AN ARRAY

AIM:
To find the smallest element in an array.

ALGORITHM:
1. Place all the elements of an array in the consecutive memory locations.
2. Fetch the first element from the memory location and load it in the accumulator.
3. Initialize a counter (register) with the total number of elements in an array.
4. Decrement the counter by 1.
5. Increment the memory pointer to point to the next element.
6. Compare the accumulator content with the memory content (next
element).
7. If the accumulator content is smaller, then move the memory content
(largest element) to the accumulator. Else continue.
8. Decrement the counter by 1.
9. Repeat steps 5 to 8 until the counter reaches zero
10. Store the result (accumulator content) in the specified memory location.

37
FLOW CHART:
START

[HL]  [8100H]

[B]  04H

[A]  [HL]

[HL  [HL] + 1

YES IS
[A] <
[HL]?
NO

[A] [HL]

[B]  [B]-1

IS NO
[B] =
0?
YES

[8105]  [A]

STOP

38
PROGRAM:

ADDRE OPCO LABEL MNEM OPER COMMENTS

SS DE ONICS AND
8001 LXI H,8100 Initialize HL reg. to
8002 8100H
8003
8004 MVI B,04 Initialize B reg with no. of
8005 comparisons(n-1)
8006 MOV A,M Transfer first data to acc.
8007 LOOP1 INX H Increment HL reg. to point
next memory location
8008 CMP M Compare M & A
8009 JC LOOP If A is lesser than M then go
800A to loop
800B
800C MOV A,M Transfer data from M to A reg
800D LOOP DCR B Decrement B reg
800E JNZ LOOP1 If B is not Zero go to loop1
800F
8010
8011 STA 8105 Store the result in a memory
8012 location.
8013
8014 HLT Stop the program

OBSERVATION:

INPUT OUTPUT
ADDRESS DATA ADDRESS DATA
8100 8105
8101
8102
8103
8104

RESULT:
Thus the smallest number in the given array is found out.

39
 7(A).ASCENDING ORDER

AIM:
To sort the given number in the ascending order using 8085 microprocessor.

ALGORITHM:

1. Get the numbers to be sorted from the memory locations.

2. Compare the first two numbers and if the first number is larger than second then I
interchange the number.
3. If the first number is smaller, go to step 4
4. Repeat steps 2 and 3 until the numbers are in required order

40
FLOWCHART:
START

[B]  04H

[HL]  [8100H]

[C]  04H

[A]  [HL]

[HL  [HL] + 1

YES IS
[A] <
[HL]?
NO

[D] [HL]

[HL]  [A]

[HL]  [HL] - 1

[HL]  [D]

[HL]  [HL] + 1

[C]  [C] – 01 H

41
 A

IS NO
[C] =
0?
YES

[B]  [B]-1

NO
IS
[B] =
0?
YES

STOP

42
PROGRAM:

ADDR OPCO LABEL MNEM OPER COMMENTS

E DE ONICS AND
SS
8000 MVI B,04 Initialize B reg with number
8001 of comparisons (n-1)
8002 LOOP 3 LXI H,8100 Initialize HL reg. to
8003 8100H
8004
8005 MVI C,04 Initialize C reg with no. of
8006 comparisons(n-1)
8007 LOOP2 MOV A,M Transfer first data to acc.
8008 INX H Increment HL reg. to point
next memory location
8009 CMP M Compare M & A
800A JC LOOP1 If A is less than M then go to
800B loop1
800C
800D MOV D,M Transfer data from M to D reg
800E MOV M,A Transfer data from acc to M
800F DCX H Decrement HL pair
8010 MOV M,D Transfer data from D to M
8011 INX H Increment HL pair
8012 LOOP1 DCR C Decrement C reg
8013 JNZ LOOP2 If C is not zero go to loop2
8014
8015
8016 DCR B Decrement B reg
8017 JNZ LOOP3 If B is not Zero go to loop3
8018
8019
801A HLT Stop the program

OBSERVATION:

INPUT OUTPUT
MEMORY DATA MEMORY DATA
LOCATION LOCATION
8100 8100
8101 8101
8102 8102
8103 8103
8104 8104

43
RESULT:

Thus the ascending order program is executed and thus the numbers are arranged
in ascending order.

44
 7(B). DESCENDING ORDER

AIM:
To sort the given number in the descending order using 8085 microprocessor.

ALGORITHM:

1. Get the numbers to be sorted from the memory locations.

2. Compare the first two numbers and if the first number is smaller than second then I
interchange the number.
3. If the first number is larger, go to step 4
4. Repeat steps 2 and 3 until the numbers are in required order

45
FLOWCHART:
START

[B]  04H

[HL]  [8100H]

[C]  04H

[A]  [HL]

[HL  [HL] + 1

NO IS
[A] <
[HL]?
YES

[D] [HL]

[HL]  [A]

[HL]  [HL] - 1

[HL]  [D]

[HL]  [HL] + 1

[C]  [C] – 01 H

46
 A

IS NO
[C] =
0?
YES

[B]  [B]-1

NO
IS
[B] =
0?
YES

STOP

47
PROGRAM:

ADDRE OPCO LABEL MNEM OPER COMMENTS

SS DE ONICS AND
8000 MVI B,04 Initialize B reg with number
8001 of comparisons (n-1)
8002 LOOP 3 LXI H,8100 Initialize HL reg. to
8003 8100H
8004
8005 MVI C,04 Initialize C reg with no. of
8006 comparisons(n-1)
8007 LOOP2 MOV A,M Transfer first data to acc.
8008 INX H Increment HL reg. to point
next memory location
8009 CMP M Compare M & A
800A JNC LOOP1 If A is greater than M then go
800B to loop1
800C
800D MOV D,M Transfer data from M to D reg
800E MOV M,A Transfer data from acc to M
800F DCX H Decrement HL pair
8010 MOV M,D Transfer data from D to M
8011 INX H Increment HL pair
8012 LOOP1 DCR C Decrement C reg
8013 JNZ LOOP2 If C is not zero go to loop2
8014
8015
8016 DCR B Decrement B reg
8017 JNZ LOOP3 If B is not Zero go to loop3
8018
8019
801A HLT Stop the program

OBSERVATION:

INPUT OUTPUT
MEMORY DATA MEMORY DATA
LOCATION LOCATION
8100 8100
8101 8101
8102 8102
8103 8103
8104 8104

48
RESULT:

Thus the descending order program is executed and thus the numbers are arranged
in descending order.

49
 8(A). CODE CONVERSION –DECIMAL TO HEX

AIM:

To convert a given decimal number to hexadecimal.

ALGORITHM:

1. Initialize the memory location to the data pointer.

2. Increment B register.
3. Increment accumulator by 1 and adjust it to decimal every time.
4. Compare the given decimal number with accumulator value.
5. When both matches, the equivalent hexadecimal value is in B register.
6. Store the resultant in memory location.

50
FLOWCHART:

START

HL 4500H

A 00

B 00H

B B+1

A A +1

Decimal adjust
accumulator

NO
Is
A=M?
YES

A B

8101 A

Stop

51
PROGRAM:

ADDRE OPCO LABEL MNEM OPER COMMENTS

SS DE ONICS AND
8000 LXI H,8100 Initialize HL reg. to
8001 8100H
8002
8003 MVI A,00 Initialize A register.
8004
8005 MVI B,00 Initialize B register..
8006
8007 LOOP INR B Increment B reg.
8008 ADI 01 Increment A reg
8009
800A DAA Decimal Adjust Accumulator
800B CMP M Compare M & A
800C JNZ LOOP If acc and given number are
800D not equal, then go to LOOP
800E
800F MOV A,B Transfer B reg to acc.
8010 STA 8101 Store the result in a memory
8011 location.
8012
8013 HLT Stop the program

RESULT:

INPUT OUTPUT
ADDRESS DATA ADDRESS DATA
8100 8101

RESULT:

Thus an ALP program for conversion of decimal to hexadecimal was written and
executed.

52
 8(B). CODE CONVERSION –HEXADECIMAL TO DECIMAL

AIM:

To convert a given hexadecimal number to decimal.

ALGORITHM:

1. Initialize the memory location to the data pointer.

2. Increment B register.
3. Increment accumulator by 1 and adjust it to decimal every time.
4. Compare the given hexadecimal number with B register value.
5. When both match, the equivalent decimal value is in A register.
6. Store the resultant in memory location.

53
 START
FLOWCHART:

HL 8100H

A 00

B 00H

C 00H

B B+1

A A +1

Decimal adjust
accumulator

Is
there
carry?

C C+1

D A, A B,

Is
A=M?
NO

8101 A, A C
8102 YES
A

Stop

54
PROGRAM:

ADDRE OPCO LABEL MNEM OPER COMMENTS

SS DE ONICS AND
8000 LXI H,8100 Initialize HL reg. to
8001 8100H
8002
8003 MVI A,00 Initialize A register.
8004
8005 MVI B,00 Initialize B register.
8006
8007 MVI C,00 Initialize C register for carry.
8008
8009 LOOP INR B Increment B reg.
800A ADI 01 Increment A reg
800B
800C DAA Decimal Adjust Accumulator
800D JNC NEXT If there is no carry go to
800E NEXT.
800F
8010 INR C Increment c register.
8011 NEXT MOV D,A Transfer A to D
8012 MOV A,B Transfer B to A
8013 CMP M Compare M & A
8014 MOV A,D Transfer D to A
8015 JNZ LOOP If acc and given number are
8016 not equal, then go to LOOP
8017
8018 STA 8101 Store the result in a memory
8019 location.
801A
801B MOV A,C Transfer C to A
801C STA 8102 Store the carry in another
801D memory location.
801E
801F HLT Stop the program

RESULT:

INPUT OUTPUT
ADDRESS DATA ADDRESS DATA
8100 8101
8102

55
RESULT:

Thus an ALP program for conversion of hexadecimal to decimal was written and
executed.

56
 9(A) BCD ADDITION
AIM:

To add two 8 bit BCD numbers stored at consecutive memory locations.

ALGORITHM:

1. Initialize memory pointer to data location.

2. Get the first number from memory in accumulator.
3. Get the second number and add it to the accumulator
4. Adjust the accumulator value to the proper BCD value using DAA instruction.
5. Store the answer at another memory location.

57
FLOW CHART:

START

[C] 00H

[HL] 4500H

[A] [M]

[HL][HL]+1

[A][A]+[M]
Decimal Adjust Accumulator
NO

Is there aYES
Carry ?

[C][C]+1

[HL][HL]+1

[M] [A]

[HL][HL]+1

[M] [C]

STOP
PROGRAM:

58
ADDRESS OPCODE LABEL MNEMONICS OPERAND COMMENT
4100 START MVI C, 00 Clear C reg.
4103
4102 LXI H, 4500 Initialize HL reg. to
4103 4500
4104
4105 MOV A, M Transfer first data to
accumulator
4106 INX H Increment HL reg. to
point next memory
Location.
4107 ADD M Add first number to
acc. Content.
4108 DAA Decimal adjust
accumulator
4109 JNC L1 Jump to location if
410A result does not yield
410B carry.
410C INR C Increment C reg.
410D L1 INX H Increment HL reg. to
point next memory
Location.
410E MOV M, A Transfer the result from
acc. to memory.
410F INX H Increment HL reg. to
point next memory
Location.
4110 MOV M, C Move carry to memory
4111 HLT Stop the program

OBSERVATION:

INPUT OUTPUT
4500 4502
4501 4503

RESULT:

Thus the 8 bit BCD numbers stored at 4500 &4501 are added and the result stored at
4502 & 4503.

59
 9(B). BCD SUBTRACTION

AIM:

To Subtract two 8 bit BCD numbers stored at consecutive memory locations.

ALGORITHM:

1. Load the minuend and subtrahend in two registers.

2. Initialize Borrow register to 0.
3. Take the 100’s complement of the subtrahend.
4. Add the result with the minuend which yields the result.
5. Adjust the accumulator value to the proper BCD value using DAA instruction.
If there is a carry ignore it.
6. If there is no carry, increment the carry register by 1
7. Store the content of the accumulator (result)and borrow register in the
specified memory location

60
FLOW CHART:
START

[D] 00H
HL 4500
B M

HL HL+ 1
C M
A 99

[A] [A] – [C]

[A] [A]+1

[A][A]+[B]
DAA

YES
Is there a
Carry ?
NO

[D][D]+1

[HL][HL]+1

[4502] A
[4503] D

STOP

PROGRAM:

61
ADDRESS OPCODE LABEL MNEMONICS OPERAND COMMENT
4100 START MVI D, 00 Clear D reg.
4101
4102 LXI H, 4500 Initialize HL reg. to
4103 4500
4104
4105 MOV B, M Transfer first data to
accumulator
4106 INX H Increment HL reg. to
point next mem.
Location.
4107 MOV C, M Move second no. to B
reg.
4108 MVI A, 99 Move 99 to the
4109 Accumulator
410A SUB C Subtract [C] from acc.
Content.
410B INR A Increment A register
410C ADD B Add [B] with [A]
410D DAA Adjust Accumulator
value for Decimal digits
410E JC LOOP Jump on carry to loop
410F
4110
4111 INR D Increment D reg.
4112 LOOP INX H Increment HL register
pair
4113 MOV M,A Move the Acc.content to
the memory location
4114 INX H Increment HL reg. to
point next mem.
Location.
4115 MOV M, D Transfer D register
content to memory.
4116 HLT Stop the program

OBSERVATION:

62
 INPUT OUTPUT
4500 4502
4501 4503

RESULT:

Thus the 8 bit BCD numbers stored at 4500 &4501 are subtracted and the result stored at
4502 & 4503.

Searching an element

63
Aim:
To write an assembly language program in 8085 to search a given number in an array of
n numbers

Algorithm –
Step 1.Make the memory pointer points to memory location 2050 by help of LXI H
2050 instruction
Step 2.Store value of array size in register C
Step 3.Store number to be search in register B
Step 4.Increment memory pointer by 1 so that it points to next array index
Step 5.Store element of array in accumulator A and compare it with value of B
Step 6.If both are same i.e. if ZF = 1 then store F0 in A and store the result in memory
location 3051 and go to step 9
Step 7.Otherwise store 0F in A and store it in memory location 3051
Step 8.Decrement C by 01 and check if C is not equal to zero i.e. ZF = 0, if true go to step
3 otherwise go to step 9
Step 9.End of program

MEMORY
ADDRESS MNEMONICS COMMENT
2000 LXI H 2050 H <- 20, L <- 50

2003 MOV C, M C <- M

2004 LDA 3050 A <- M[3050]

2007 MOV B, A B <- A

2008 INX H HL <- HL + 0001

2009 MOV A, M A <- M

200A CMP B A–B

200B JNZ 2014 Jump if ZF = 0

200E MVI A F0 A <- F0

2010 STA 3051 M[3051] <- A

2013 HLT END

2014 MVI A 0F A <- 0F

2016 STA 3051 M[3051] <- A

64
2019 DCR C C <- C – 01

201A JNZ 2008 Jump if ZF = 0

201D HLT END

Result
Thus ALP program to search an element has been written and executed using 8085
assembly language programming.

65