Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
62 views

Programming For Learners 8085

The document provides solutions to 15 programming problems for an 8085 microprocessor. The problems cover tasks like storing and retrieving data from memory locations, adding and subtracting 16-bit numbers, finding ones and twos complements, shifting bits, counting bits, sorting numbers, calculating sums of series, finding squares, searching bytes, and separating even numbers. The solutions show the assembly language instructions needed to complete each task.

Uploaded by

Rajesh Pathak
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
62 views

Programming For Learners 8085

The document provides solutions to 15 programming problems for an 8085 microprocessor. The problems cover tasks like storing and retrieving data from memory locations, adding and subtracting 16-bit numbers, finding ones and twos complements, shifting bits, counting bits, sorting numbers, calculating sums of series, finding squares, searching bytes, and separating even numbers. The solutions show the assembly language instructions needed to complete each task.

Uploaded by

Rajesh Pathak
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Programming For Learners

1. Store 8-bit data in memory of 8085 microprocessor


2. Exchange the contents of memory locations in a 8085 microprocessor
3. Add two 16-bit numbers in a 8085 microprocessor
4. Add contents of two memory locations in a 8085 microprocessor
5. Subtract two 16-bit numbers in a 8085 microprocessor.
6. Finding ones complement of a number
7. Finding Twos complement of a number
8. Right shift bit of data

9. Count number of ones in a number


10. Arrange in ascending order
11. Calculate the sum of series of even numbers
12. Calculate the sum of series of odd numbers
13. Find the square of given number
14. Search a byte in a given number
15. Separate even numbers from given numbers

Solutions
1. MVI A, 52H : Store 32H in the accumulator
STA 4000H : Copy accumulator contents at address 4000H
HLT : Terminate program execution

2.

LDA 2000H
MOV B, A
LDA 4000H
STA 2000H
MOV A, B
STA 4000H

: Get the contents of memory location 2000H into accumulator


: Save the contents into B register
: Get the contents of memory location 4000Hinto accumulator
: Store the contents of accumulator at address 2000H
: Get the saved contents back into A register
: Store the contents of accumulator at address 4000H

Q3.
LHLD 4000H
XCHG
LHLD 4002H
MOV A, E
ADD L

: Get first I6-bit number in HL


: Save first I6-bit number in DE
: Get second I6-bit number in HL
: Get lower byte of the first number
: Add lower byte of the second number

MOV L, A

: Store result in L register

MOV A, D

: Get higher byte of the first number

ADC H
MOV H, A
SHLD 4004H
HLT

: Add higher byte of the second number with CARRY


: Store result in H register
: Store I6-bit result in memory locations 4004H and 4005H.
: Terminate program execution

4. Statement: Add the contents of memory locations 4000H and 4001H and place the result
in the memory locations 4002Hand 4003H.
LXI H, 4000H :HL Points 4000H
MOV A, M :Get first operand
INX H :HL Points 4001H
ADD M :Add second operand
INX H :HL Points 4002H
MOV M, A :Store the lower byte of result at 4002H
MVIA, 00 :Initialize higher byte result with 00H
ADC A :Add carry in the high byte result
INX H :HL Points 4003H
MOV M, A :Store the higher byte of result at 4003H

HLT :Terminate program execution

4. LHLD 4000H
XCHG
LHLD 4002H
MOV A, E
SUB L
MOV L, A
MOV A, D
SBB H
MOV H, A
4005H.
SHLD 4004H
4005H.
HLT
5. LDA 4200H
CMA
ADI, 01 H
STA 4300H
HLT

: Get first 16-bit number in HL


: Save first 16-bit number in DE
: Get second 16-bit number in HL
: Get lower byte of the first number
: Subtract lower byte of the second number
: Store the result in L register
: Get higher byte of the first number
: Subtract higher byte of second number with borrow
: Store l6-bit result in memory locations 4004H and
: Store l6-bit result in memory locations 4004H and
: Terminate program execution.
: Get the number
: Complement the number
: Add one in the number
: Store the result
: Terminate program execution

6. Find the ls complement of the number stored at memory location


4400H and store the complemented number at memory location 4300H.

LDA 4400B : Get the number


CMA : Complement number
STA 4300H : Store the result
HLT : Terminate program execution
7Find the 2s complement of the number stored at memory location
4200H and store the complemented number at memory location 4300H

LDA 4200H : Get the number


CMA : Complement the number
ADI, 01 H : Add one in the number
STA 4300H : Store the result
HLT : Terminate program execution
8 Statement: Write a program to shift an eight bit data four bits right. Assume data is in
register C.

MOV A, C
RAR
RAR
RAR
RAR
MOV C, A
HLT
9. Statement: Write a program to count number of ls in the contents of D
register and store the count in the B register

MVI B, 00H
MVI C, 08H
MOV A, D
BACK: RAR
JNC SKIP
INR B
SKIP: DCR C
JNZ BACK
HLT
10. Write a program to sort given 10 numbers from memory location 2200H in
the ascending order.

MVI B, 09 : Initialize counter


START : LXI H, 2200H: Initialize memory pointer
MVI C, 09H : Initialize counter 2
BACK: MOV A, M : Get the number
INX H : Increment memory pointer
CMP M : Compare number with next number

JC SKIP : If less, dont interchange


JZ SKIP : If equal, dont interchange
MOV D, M
MOV M, A
DCX H
MOV M, D
INX H : Interchange two numbers
SKIP:DCR C : Decrement counter 2
JNZ BACK : If not zero, repeat
DCR B : Decrement counter 1
JNZ START
HLT : Terminate program execution
11. Statement: Calculate the sum of series of even numbers from
the list of numbers. The length of the list is in memory location
2200H and the series itself begins from memory location 2201H.
Assume the sum to be 8 bit number so you can ignore carries and
store the sum at memory location 2210H.

LDA 2200H
MOV C, A : Initialize counter
MVI B, 00H : sum = 0
LXI H, 2201H : Initialize pointer
BACK: MOV A, M : Get the number
ANI 0lH : Mask Bit l to Bit7
JNZ SKIP : Dont add if number is ODD
MOV A, B : Get the sum
ADD M : SUM = SUM + data
MOV B, A : Store result in B register

SKIP: INX H : increment pointer


DCR C : Decrement counter
JNZ BACK : if counter 0 repeat
STA 2210H : store sum
HLT : Terminate program execution
12. Statement: Calculate the sum of series of odd numbers from the list of
numbers. The length of the list is in memory location 2200H and the series
itself begins from memory location 2201H. Assume the sum to be 16-bit.
Store the sum at memory locations 2300H and 2301H.

LDA 2200H
MOV C, A : Initialize counter
LXI H, 2201H : Initialize pointer
MVI E, 00 : Sum low = 0
MOV D, E : Sum high = 0
BACK: MOV A, M : Get the number
ANI 0lH : Mask Bit 1 to Bit7
JZ SKIP : Dont add if number is even
MOV A, E : Get the lower byte of sum
ADD M : Sum = sum + data
MOV E, A : Store result in E register
JNC SKIP
INR D : Add carry to MSB of SUM
SKIP: INX H : Increment pointer

13.Statement: Find the square of the given numbers from memory


location 6100H and store the result from memory location 7000H. LXI

H, 6200H : Initialize lookup table pointer


LXI D, 6100H : Initialize source memory pointer
LXI B, 7000H : Initialize destination memory pointer

BACK: LDAX D : Get the number


MOV L, A : A point to the square
MOV A, M : Get the square
STAX B : Store the result at destination memory location
INX D : Increment source memory pointer
INX B : Increment destination memory pointer
MOV A, C
CPI 05H : Check for last number
JNZ BACK : If not repeat
HLT : Terminate program execution
14Statement: Search the given byte in the list of 50 numbers stored in
the consecutive memory locations and store the address of memory location
in the memory locations 2200H and 2201H. Assume byte is in the C register
and starting address of the list is 2000H. If byte is not found store 00 at
2200H and 2201H

LX I H, 2000H : Initialize memory pointer 52H


MVI B, 52H : Initialize counter
BACK: MOV A, M : Get the number
CMP C : Compare with the given byte
JZ LAST : Go last if match occurs
INX H : Increment memory pointer
DCR B : Decrement counter
JNZ B : I f not zero, repeat
LXI H, 0000H
SHLD 2200H
JMP END : Store 00 at 2200H and 2201H

LAST: SHLD 2200H : Store memory address


END: HLT : Stop
15. Statement: Write an assembly language program to separate even
numbers from the given list of 50 numbers and store them in the another list
starting from 2300H. Assume starting address of 50 number list is 2200H.

LXI H, 2200H : Initialize memory pointer l


LXI D, 2300H : Initialize memory pointer2
MVI C, 32H : Initialize counter
BACK:MOV A, M : Get the number
ANI 0lH : Check for even number
JNZ SKIP : If ODD, dont store
MOV A, M : Get the number
STAX D : Store the number in result list
INX D : Increment pointer 2
SKIP: INX H : Increment pointer l
DCR C : Decrement counter
JNZ BACK : If not zero, repeat
HLT : Stop

You might also like