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

Which translator perform macro expansion, Which translator perform macro ex...

Which translator perform macro expansion, is called? Ans. Macro pre-processor perform macro expansion.

Explain dead code elimination, Explain briefly Dead code Elimination of the...

Explain briefly Dead code Elimination of the commonly used code optimization techniques Dead code Elimination: Code which is unreachable or which does not influence the pr

Recursive binary search, The implementation of a (non-recursive) binary sea...

The implementation of a (non-recursive) binary search of an array. The assumption is that a given array is sorted. We want to see if a particular value, that we'll call the target

Pipeline, where can I find detailed explanation of 6 stage and 7 stage pipe...

where can I find detailed explanation of 6 stage and 7 stage pipeline ??

Explain cache-only memory access model (coma), Cache-Only Memory Access Mod...

Cache-Only Memory Access Model (COMA) As we have considered earlier, shared memory multiprocessor systems can use cache memories with each processor for decreasing the execution

Web designing, how to start a web designing would you please guide me

how to start a web designing would you please guide me

How much CMOS circuits consume power, CMOS circuits consume power ? An...

CMOS circuits consume power ? Ans. As in CMOS one device is ON and one is Always OFF therefore power consumption is low or can say less than TTL.

Explain grade of service with reference to telephone traffic, With referenc...

With reference to telephone traffic, explain the terms GOS. GOS: in loss systems, the traffic carried through the network is usually lower than the actual traffic offered to

Which is the best tool for monitoring weblogic server(wls8), WLS8 handles J...

WLS8 handles JMX but it uses weblogic execution of JMX server. It does not supports generalise sun javax API which can be used with any JVM. There are some patches available which

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