Programming the 8085
Home
Graphics
C++
Data Structures
Thursday, July 29, 2010
16 bit substraction
11. Program to subtract two 16 bit numbers.
0000 11 01 50 LXI D,5001H 0003 21 03 50 LXI H,5003H 0006 06 00 MVI B,00H 0008 1A LDAX D 0009 96 SUB M 000A 4F MOV C,A 000B 1B DCX D 000C 2B DCX H 000D 1A LDAX D 000E 9E SBB M 000F D2 20 00 JNC J1 0012 2F CMA 0013 47 MOV B,A 0014 79 MOV A,C 0015 2F CMA 0016 C6 01 ADI 01H 0018 D2 1C 00 JNC J2 001B 04 INR B 001C 4F J2: MOV C,A 001D 78 MOV A,B 001E 06 01 MVI B,01H 0020 23 J1: INX H 0021 23 INX H 0022 77 MOV M,A 0023 23 INX H 0024 71 MOV M,C 0025 23 INX H 0026 70 MOV M,B 0027 76 HLT
Largest of N numbers
10. Program to find the largest of N numbers.
0000 21 00 50 LXI H,5000H 0003 46 MOV B,M 0004 23 INX H 0005 7E MOV A,M 0006 05 DCR B 0007 23 LOOP: INX H 0008 BE CMP M 0009 DA 0D 00 JNC J1 000C 7E MOV A,M 000D 05 J1: DCR B 000E C2 07 00 JNZ LOOP 0011 23 INX H 0012 77 MOV M,A 0013 76 HLT
Smallest of N numbers
9. Program to find the smallest of N numbers.
0000 21 00 50 LXI H,5000H 0003 46 MOV B,M 0004 23 INX H 0005 7E MOV A,M 0006 05 DCR B 0007 23 LOOP: INX H 0008 BE CMP M 0009 DA 0D 00 JC J1 000C 7E MOV A,M 000D 05 J1: DCR B 000E C2 07 00 JNZ LOOP 0011 23 INX H 0012 77 MOV M,A 0013 76 HLT
Add N one byte numbers
8. Program to add N one byte numbers.
0000 21 00 50 LXI H,05000H 0003 4E MOV C,M 0004 AF XRA A 0005 57 MOV D,A 0006 23 LOOP: INX H 0007 86 ADD M 0008 D2 0C 00 JNC J1 000B 14 INR D 000C 0D J1: DCR C 000D C2 06 00 JNZ LOOP 0010 23 INX H 0011 77 MOV M,A 0012 23 INX H 0013 72 MOV M,D 0014 76 HLT
Move a data block without overlap
7. Program to move a data block without overlap.
0000 21 00 50 LXI H,5000H 0003 11 00 51 LXI D,5100H 0006 4E MOV C,M 0007 23 INX H 0008 7E LOOP: MOV A,M 0009 12 STAX D 000A 23 INX H 000B 13 INX D 000C 0D DCR C 000D C2 08 00 JNZ LOOP 0010 76 HLT
Tuesday, July 27, 2010
Descending Order
6.Arrange an array of data in descending order
0000 21 00 FF LXI H,0FF00H //FF00h condain no: of items 0003 56 MOV D,M 0004 15 DCR D 0005 4A LOOP1: MOV C,D 0006 21 10 FF LXI H,0FF10H 0009 7E LOOP2: MOV A,M 000A 23 INX H 000B BE CMP M 000C DA 15 00 JNC J1 000F 46 MOV B,M 0010 77 MOV M,A 0011 78 MOV A,B 0012 2B DCX H 0013 77 MOV M,A 0014 23 INX H 0015 0D J1: DCR C 0016 C2 09 00 JNZ LOOP2 0019 15 DCR D 001A C2 05 00 JNZ LOOP1 001D 76 HLT
Ascending Order
5.Arrange an array of data in ascending order
0000 21 00 FF LXI H,0FF00H //FF00h condain no: of items 0003 56 MOV D,M 0004 15 DCR D 0005 4A LOOP1: MOV C,D 0006 21 10 FF LXI H,0FF10H 0009 7E LOOP2: MOV A,M 000A 23 INX H 000B BE CMP M 000C DA 15 00 JC J1 000F 46 MOV B,M 0010 77 MOV M,A 0011 78 MOV A,B 0012 2B DCX H 0013 77 MOV M,A 0014 23 INX H 0015 0D J1: DCR C 0016 C2 09 00 JNZ LOOP2 0019 15 DCR D 001A C2 05 00 JNZ LOOP1 001D 76 HLT
8 bit division
4. Division of two 8 bit numbers
0000 21 00 FF LXI H,0FF00H 0003 7E MOV A,M 0004 23 INX H 0005 0E 00 MVI C,00H 0007 BE LOOP: CMP M 0008 DA 10 00 JC J1 000B 96 SUB M 000C 0C INR C 000D C3 07 00 JMP LOOP 0010 23 J1: INX H 0011 71 MOV M,C 0012 23 INX H 0013 77 MOV M,A 0014 76 HLT
8 bit multiplication
3. Multiplication of two 8 bit numbers
0000 21 00 FF LXI H,0FF00H 0003 4E MOV C,M 0004 23 INX H 0005 AF XRA A 0006 47 MOV B,A 0007 86 LOOP: ADD M 0008 D2 0C 00 JNC J1 000B 04 INR B 000C 0D J1: DCR C 000D C2 07 00 JNZ LOOP 0010 23 INX H 0011 77 MOV M,A 0012 23 INX H 0013 70 MOV M,B 0014 76 HLT
8 bit substraction
2. Substraction of two 8 bit numbers
0000 21 00 FF LXI H,0FF00H 0003 0E 00 MVI C,00H 0005 7E MOV A,M 0006 23 INX H 0007 96 SUB M 0008 D2 0E 00 JNC J1 000B 2F CMA 000C 3C INR A 000D 0C INR C 000E 23 J1: INX H 000F 77 MOV M,A 0010 23 INX H 0011 71 MOV M,C 0012 76 HLT
8 bit addition
1. Addition of two 8 bit numbers
0000 21 00 FF LXI H,0FF00H 0003 AF XRA A 0004 47 MOV B,A 0005 7E MOV A,M 0006 23 INX H 0007 86 ADD M 0008 D2 0C 00 JNC L1 000B 04 INR B 000C 23 L1: INX H 000D 77 MOV M,A 000E 23 INX H 000F 70 MOV M,B 0010 76 HLT
Newer Posts
Home
Subscribe to:
Posts (Atom)
