ALGORITHM:

1. Initialize HL pair as memory pointer
2. Get the count at 4200 into C – register
3. Copy it in D – register (for bubble sort (N-1) times required)
4. Get the first value in A – register
5. Compare it with the value at next location.
6. If they are out of order, exchange the contents of A –register and Memory
7. Decrement D –register content by 1
8. Repeat steps 5 and 7 till the value in D- register become zero
9. Decrement C –register content by 1
10. Repeat steps 3 to 9 till the value in C – register becomes zero

PROGRAM:

        LXI H,4200
        MOV C,M
        DCR C 
REPEAT: MOV D,C
        LXI H,4201
LOOP:   MOV A,M
        INX H
        CMP M
        JNC SKIP
        MOV B,M
        MOV M,A
        DCX H
        MOV M,B
        INX H
SKIP:   DCR D
        JNZ LOOP
        DCR C
        JNZ REPEAT
        HLT

OBSERVATION:

RESULT: Thus the given array of data was arranged in descending order.

The post ASM program to arrange an array of data in descending order using 8085 first appeared on Student Projects.

ALGORITHM:

1. Initialize HL pair as memory pointer
2. Get the count at 4200 into C – register
3. Copy it in D – register (for bubble sort (N-1) times required)
4. Get the first value in A – register
5. Compare it with the value at next location.
6. If they are out of order, exchange the contents of A –register and Memory
7. Decrement D –register content by 1
8. Repeat steps 5 and 7 till the value in D- register become zero
9. Decrement C –register content by 1
10. Repeat steps 3 to 9 till the value in C – register becomes zero

PROGRAM:

        LXI H,4200
        MOV C,M
        DCR C 
REPEAT: MOV D,C
        LXI H,4201
LOOP:   MOV A,M
        INX H
        CMP M
        JC SKIP
        MOV B,M
        MOV M,A
        DCX H
        MOV M,B
        INX H
SKIP:   DCR D
        JNZ LOOP
        DCR C
        JNZ REPEAT
        HLT

OBSERVATION:

RESULT: Thus the given array of data was arranged in ascending order.

The post ASM program to arrange an array of data in ascending order using 8085 first appeared on Student Projects.

ALGORITHM:

1. Load the address of the first element of the array in HL pair
2. Move the count to B – reg.
3. Increment the pointer
4. Get the first data in A – reg.
5. Decrement the count.
6. Increment the pointer
7. Compare the content of memory addressed by HL pair with that of A – reg.
8. If carry = 1, go to step 10 or if Carry = 0 go to step 9
9. Move the content of memory addressed by HL to A – reg.
10. Decrement the count
11. Check for Zero of the count. If ZF = 0, go to step 6, or if ZF = 1 go to next step.
12. Store the smallest data in memory.
13. Terminate the program.

PROGRAM:

       LXI H,4200 ;Set pointer for array 
       MOV B,M    ;Load the Count
       INX H
       MOV A,M    ;Set 1st element as largest data
       DCR B      ;Decrement the count
LOOP:  INX H
       CMP M      ;If A-reg < M go to AHEAD
       JC AHEAD
       MOV A,M    ;Set the new value as largest
AHEAD: DCR B
       JNZ LOOP   ;Repeat comparisons till count = 0
       STA 4300   ;Store the largest value at 4300
       HLT

OBSERVATION:

RESULT:

Thus the program to find the smallest number in an array of data was executed.

The post ASM program to find the smallest number in an array of data using 8085 first appeared on Student Projects.

ALGORITHM:

1. Load the address of the first element of the array in HL pair
2. Move the count to B – reg.
3. Increment the pointer
4. Get the first data in A – reg.
5. Decrement the count.
6. Increment the pointer
7. Compare the content of memory addressed by HL pair with that of A – reg.
8. If Carry = 0, go to step 10 or if Carry = 1 go to step 9
9. Move the content of memory addressed by HL to A – reg.
10. Decrement the count
11. Check for Zero of the count. If ZF = 0, go to step 6, or if ZF = 1 go to next step.
12. Store the largest data in memory.
13. Terminate the program.

PROGRAM:

       LXI H,4200 ;Set pointer for array 
       MOV B,M    ;Load the Count
       INX H
       MOV A,M    ;Set 1st element as largest data
       DCR B      ;Decrement the count
LOOP:  INX H
       CMP M      ;If A- reg > M go to AHEAD
       JNC AHEAD
       MOV A,M    ;Set the new value as largest
AHEAD: DCR B
       JNZ LOOP   ;Repeat comparisons till count = 0
       STA 4300   ;Store the largest value at 4300
       HLT

OBSERVATION:

RESULT:

Thus the program to find the largest number in an array of data was executed.

The post ASM program to find the largest number in an array of data using 8085 first appeared on Student Projects.

To perform the division of two 8 bit numbers using 8085.

ALGORITHM:

1. Start the program by loading HL register pair with address of memory location.
2. Move the data to a register(B register).
3. Get the second data and load into Accumulator.
4. Compare the two numbers to check for carry.
5. Subtract the two numbers.
6. Increment the value of carry .
7. Check whether repeated subtraction is over and store the value of product and carry in memory location.
8. Terminate the program.

PROGRAM:

      LXI H, 4150
      MOV B, M   ;Get the dividend in B – reg.
      MVI C, 00  ;Clear C – reg for qoutient
      INX H
      MOV A, M   ;Get the divisor in A – reg.
NEXT: CMP B      ;Compare A - reg with register B.
      JC LOOP    ;Jump on carry to LOOP
      SUB B      ;Subtract A – reg from B- reg.
      INR C      ;Increment content of register C.
      JMP NEXT   ;Jump to NEXT
LOOP: STA 4152   ;Store the remainder in Memory
      MOV A, C
      STA 4153   ;Store the quotient in memory
      HLT        ;Terminate the program.

OBSERVATION:

Input: FF (4150)

FF (4251)

Output: 01 (4152) Remainder

FE (4153) Quotient

RESULT:

Thus the program to divide two 8-bit numbers was executed.

The post ASM program to divide two 8 bit numbers using 8085 first appeared on Student Projects.

ALGORITHM:

1. Start the program by loading HL register pair with address of memory location.
2. Move the data to a register (B register).
3. Get the second data and load into Accumulator.
4. Add the two register contents.
5. Check for carry.
6. Increment the value of carry.
7. Check whether repeated addition is over and store the value of product and carry in memory location.
8. Terminate the program.

PROGRAM:

      MVI D, 00   ;Initialize register D to 00
      MVI A, 00   ;Initialize Accumulator content to 00
      LXI H, 4150
      MOV B, M    ;Get the first number in B - reg
      INX H
      MOV C, M    ;Get the second number in C- reg.
LOOP: ADD B       ;Add content of A - reg to register B.
      JNC NEXT    ;Jump on no carry to NEXT.
      INR D       ;Increment content of register D
NEXT: DCR C       ;Decrement content of register C.
      JNZ LOOP    ;Jump on no zero to address
      STA 4152    ;Store the result in Memory
      MOV A, D
      STA 4153    ;Store the MSB of result in Memory
      HLT         ;Terminate the program.

OBSERVATION:

RESULT:

Thus the program to multiply two 8-bit numbers was executed.

The post ASM program to multiply two 8 bit numbers using 8085 first appeared on Student Projects.

ALGORITHM:

1. Start the program by loading the first data into Accumulator.
2. Move the data to a register (B register).
3. Get the second data and load into Accumulator.
4. Subtract the two register contents.
5. Check for carry.
6. If carry is present take 2’s complement of Accumulator.
7. Store the value of borrow in memory location.
8. Store the difference value (present in Accumulator) to a memory
9. location and terminate the program.

PROGRAM:

      MVI C, 00 ;Initialize C to 00
      LDA 4150  ;Load the value to Acc.
      MOV B, A  ;Move the content of Acc to B register.
      LDA 4151  ;Load the value to Acc.
      SUB B
      JNC LOOP  ;Jump on no carry.
      CMA       ;Complement Accumulator contents.
      INR A     ;Increment value in Accumulator.
      INR C     ;Increment value in register C
LOOP: STA 4152  ;Store the value of A-reg to memory address.
      MOV A, C  ;Move contents of register C to Accumulator.
      STA 4153  ;Store the value of Accumulator memory address.
      HLT       ;Terminate the program.

OBSERVATION:

RESULT:

Thus the program to subtract two 8-bit numbers was executed.

The post ASM program to subtract two 8 bit numbers using 8085 first appeared on Student Projects.

ALGORITHM:

1. Start the program by loading the first data into Accumulator.
2. Move the data to a register (B register).
3. Get the second data and load into Accumulator.
4. Add the two register contents.
5. Check for carry.
6. Store the value of sum and carry in memory location.
7. Terminate the program.

PROGRAM:

      MVI C, 00 ;Initialize C register to 00
      LDA 4150  ;Load the value to Accumulator.
      MOV B, A  ;Move the content of Accumulator to B register.
      LDA 4151  ;Load the value to Accumulator.
      ADD B     ;Add the value of register B to A
      JNC LOOP  ;Jump on no carry.
      INR C     ;Increment value of register C
LOOP: STA 4152  ;Store the value of Accumulator (SUM).
      MOV A, C  ;Move content of register C to Acc.
      STA 4153  ;Store the value of Accumulator (CARRY)
      HLT       ;Halt the program.

OBSERVATION:

RESULT:

Thus the program to add two 8-bit numbers were executed.

The post ASM program to add two 8 bit numbers using 8085 first appeared on Student Projects.

MOV AX, DATA
MOV DS, AX
MOV CL, 05
XOR BL, BL
XOR DL, DL
LEA SI, SERIES

NEXT2:	MOV AL, [SI]
SHR AL, O1
JNC NEXT1
INC BL
JMP NEXT3
NEXT1:	INC DL
NEXT3:	INC SI
DEC CL
JNZ NEXT2
MOV POS, DL
MOV NEG, BL
END

Result: The numbers of positive and negative numbers are counted from the given series.

The post ASM program to count number of positive and negative numbers from a given series of numbers first appeared on Student Projects.

MOV CL, 05
XOR BL, BL
XOR DL, DL
LEA SI, SERIES
NEXT2:	MOV AL, [SI]
SHR AL, O1
JNC NEXT1

INC BL
JMP NEXT3
NEXT1:	INC DL
NEXT3:	INC SI
DEC CL
JNZ NEXT2
MOV EVEN, DL
MOV ODD, BL
END

Result: The numbers of even and odd numbers are counted from the given series.

The post ASM program to count the number of even and odd numbers from a given series first appeared on Student Projects.