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

What is called when network address prefixed by 1110, Network address prefi...

Network address prefixed by 1110 is a? Network address prefixed through 1110 is a multicast address.

Summary of tasks, Summary of Tasks Task Summary attempts to show amoun...

Summary of Tasks Task Summary attempts to show amount of duration every task has spent starting from beginning of task until its completion on any processor as displayed in Fi

Microprocessors Instruction sets, Write a program to mask bits D3D2D1D0 and...

Write a program to mask bits D3D2D1D0 and to set bits D5D4 and to invert bits D7D6 of the AX register.

Describe loading disk operating system, Q. Describe Loading Disk Operating ...

Q. Describe Loading Disk Operating System? Different version of DOS, such as 2.0, 3.0, 3.2, 4.0, 5.0, 6.0, 6.2, 6.22, 7.0, 7.2 are present. The newer versions have additional

What is race around condition, What is race around condition? Ans: ...

What is race around condition? Ans: Race Around Condition:- Jn Kn Q(n+1) output   0 1 0 1   0 0

Minimum total number of shelv, Write a program that finds the minimum total...

Write a program that finds the minimum total number of shelv, C/C++ Programming

What is grade of service, What is Grade of service? Grade of service:...

What is Grade of service? Grade of service: In a loss system, the traffic carried through the network is usually lower than the actual traffic offered to the network through

Develop a simple patient management system, In the first part of Assignment...

In the first part of Assignment 2A you will develop a simple Patient class, representing an Patient who is to be admitted for a minor procedure that only requires a 1-2 day stay in

Use of large register file, Generally the register storage is faster than c...

Generally the register storage is faster than cache andmain memory. Also register addressing uses much shorter addresses than addresses for cache and main memory. Though the number

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