programb37 - Microprocessors Applications(UPTU Explanation...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Appendix B ØØ Explanation : We have an array of 10 numbers. So we initialize the counter with 10. Also we initialize a pointer to point these numbers. Compare first number with initial maximum number i.e. zero. If number > maximum number, save number otherwise increment pointer to compare next number. Decrement counter, compare till all the numbers are compared. Store the maximum number in MAX. Display the maximum number. ØØ Algorithm : Step I : Initialize the data segment. Step II : Initialize pointer. Step III : Initialize counter. Step IV : Initialize base pointer for array. Step V : Compare number with maximum. If no carry goto step VII Step VI : Save the maximum number. Step VII : Decrement counter. Step VIII : Increment pointer. Step IX : Check if count = 0. If not goto step V. Step X : Store the maximum number. Step XI : Display result. Step XII
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/04/2011 for the course ECON 101 taught by Professor Lucky during the Spring '11 term at Silver Lake.

Page1 / 3

programb37 - Microprocessors Applications(UPTU Explanation...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online