Minimum and maximum algorithm, Computer Engineering

Assignment Help:

For this assignment, you will need to create an ARM assembly language code routine that implements an algorithm to search through an array and find BOTH the minimum and maximum values. You should find both of these values on a SINGLE pass through the array. In other words, don't use separate loops to search for the minimum and maximum values. You will then return both of the values to main.c which will display them, one at a time, on the LCD.

You will use the program files included in EECE337_Program2.zip. As with the last assignment you will need to unzip this file into your working directory. It contains an IAR EWARM project that includes among other files, main.c and min_max.s. For this assignment, you do NOT need to modify main.c. You will be adding your code to min_max.s. The only reason you should need to change main.c is if you want to modify the values in the input array through which you will be searching.

The signature for the min_max function is:

min_max(int X[], unsigned int size, int *min, int *max)

• X is the array
• size is the length of the array
• min is a pointer to an integer that will store the minimum value
• max is a pointer to an integer that will store the maximum value

A complete solution will display the results on the LCD of your board.

Turn In:

You will need to upload your main.c and min_max.s files and two .jpg photos of the output on your board using the Vista assignment upload features. One photo should show the minimum value and the other photo should show the maximum value, as determined by your assembly code algorithm. Everything must be submitted by the deadline. The comments on your main.c and min_max.s files must include the following information:

// Name:
// Partner:
// EECE 337 - Fall 2011


Related Discussions:- Minimum and maximum algorithm

Determine reduced boolean equation and the karnaugh map, Determine reduced ...

Determine reduced Boolean equation and the Karnaugh Map? Illustration : Determine reduced Boolean equation and the Karnaugh Map for the truth table shown below:

Explain working of bit serial associative processor, Q. Explain working of ...

Q. Explain working of Bit Serial Associative Processor? When associative processor accepts bit serial memory organization subsequently it is known as bit serial associative pr

Which device converts BCD to seven segment, A device which converts BCD to ...

A device which converts BCD to Seven Segment is called ? Ans. DECODER is a device that converts BCD to Seven Segment. This coverts binary words in alphanumeric characters.

Over fitting considerations - artificial intelligence, Over fitting Conside...

Over fitting Considerations - artificial intelligence Left  unexamined ,  back  propagation  in  multi-layer  networks  may  be very susceptible  to over fitting itself to the

C program, a c program to implement multiple stack in a single array

a c program to implement multiple stack in a single array

Interrupt - driven input-output, Q. Interrupt - Driven Input-output? Pr...

Q. Interrupt - Driven Input-output? Problem with programmed I/O is that processor has to wait a long time for I/O interface to see whether a device is free or waits until compl

Project, how many pins does a floppy drive connector have

how many pins does a floppy drive connector have

Write an algorithm for the braking system, Question: a) Consider a car ...

Question: a) Consider a car having a collision detection mechanism. Write an algorithm (in simple English) to illustrate the collision detection mechanism. b) The same car

Auto increment mode and condition code flags, Described auto increment mode...

Described auto increment mode of addressing? Ans: Effective address of the operand is the contents of a register mention in the instruction. After finishing the accessing t

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd