CMIS 310

8085 lab exercise 


Show the layout in memory of the #1's counting program onescountDFW.85
Use the format as in class.


Make a subroutine version of your division program.


Write a program that will find the largest number in an "array" of
numbers.   The array will be a sequence of bytes starting at some
address.  The number of them (n) will be in some location, say 0.
Place the largest at 1.
Use register indirect addressing with the HL register pair (i.e. load
it/them with the starting address of the array).  Loop n times, incrementing
the HL each time so to access the next location in the array.