Assembly Language -- 2

1. Write an Intel 8085 assembly program to find the largest of N numbers stored in memory using the algorithm below. Hand trace (execute) the program showing the changes made to all affected registers and memory locations.

Max = a(1)

For i = n to N

If max < a(i) then max = a(i)

Next i

2. Write an Intel 8085 assembly language program that counts the number of 1s in a binary number stored in the accumulator. Use the algorithm below. Hand assemble (produce hexadecimal code using code tables) the code for the first 10 lines of the program.

Tally = 0;

For i = 1 to 8

Shift accumulator once to the right

If carry = 1 then increment ONES

Next i

3. Use an algorithm similar to one in Question 2 to find the parity (odd/even) of a binary number stored in the accumulator.

4. A text is stored in a memory block, in ASCII format. Transform all lower-case characters of this text into upper-case, leaving numbers, special characters, and upper case characters unchanged.

Hello
I have implemented many 8085 assembly language programs like Fibonacci, arrays, sorting, searching, and subroutines. So I think I am best fit for this task.
I assure you that if you will work with me once the更多