logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

This will be the second assignment using ARMv7 assembly language in the VisUAL emulator.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Computer Architecture

This will be the second assignment using ARMv7 assembly language in the VisUAL emulator. The assignment will be similar to one used in the instructor's older  classes. This program is intended to validate a United States Postal Service ZIP code, and to return the state associated with that ZIP code. You will receive an array of DCD statements, starting label Zips, which comprises 61 triplets of integer numbers:The state code

 

The lowest ZIP code in that state's range

The highest ZIP code in that state's range

 

(The state code is based upon the old Federal Information Processing Standards (FIPS), which are now part of an ANSI standard.) This triplet corresponds to the following C++ struct:

 

For example, the values for the state of California are:

 

 

The label Z6 is provided because the VisUAL emulator requires one for DCD statements. The state code is 6, the low ZIP code is 90000, and the high ZIP code for California is 96199.

 

Note that some states have more than one ZIP code range associated with them. These labels will have letters appended to the name. The labels have no particular significance for the solution of this problem.

 

You will be given an integer input value containing a ZIP code (the search ZIP code). This ZIP code will be contained in a DCD with the label ThisZip. Your program should do the following: Determine if the ZIP code (ThisZip) is within limits (ZIP > 0 and ZIP < 99999)

Search the table from beginning to end looking for the state which contains this ZIP code:

o The low ZIP code in the table entry is less than or equal to the search ZIP code.

o The high ZIP code in the table entry is greater than or equal to the search ZIP code.

When a matching table entry is found, set the following result variables:

o The DCD GoodZip shall be set to 1 if valid if ThisZip is valid and contained in a table entry

o The DCD ThisSt shall be set to the state code from the matching table entry if found

If no matching table entry is found, set the GoodZip and ThisSt variables to zero.

The program ends at this point.

 

For grading, the instructor will set various valid, invalid, and missing ZIP codes into the ThisZip variable. Your test data should include:

 

 

a negative number,

zero,

a ZIP code which is within limits but not found in any table entry (such as 333),

a valid ZIP code (such as 91371, the Pierce College ZIP code), and

a number greater than 99999 You do not turn in the test data.

The input will be the following variable in your program:

 

The actual number of array entries will be in a variable named maxI. You may use this as a limit in a for loop. The output of your program will be the values placed in the following variables:

GoodZip : a value of 1 if the ZIP code in ThisZip is valid and found in the table, or 0 if not

ThisSt: the state code from the matching entry in the table, or zero if the ZIP code did not match any entry Your program must use the variable names ThisZip, GoodZip, and ThisSt.

Your program will be tested with the set of values shown later in this assignment. Copy and paste the Zips table into your program. You may assume that the Zips array will contain the number of entries in the maxI value.

 

Grading

 

The following standard will be used for grading:

 

Successful assembly and execution with no error messages: 8 points

 

Correct output values in the GoodZip and ThisSt variables: a total of 32 points allocated among several test cases Your program should include the following line at the begining:

Points will be deducted if this is missing or incorrect. "Last, first" is your name, and "nnnnn" is your section number.

Note On File Type

The VisUAL emulator saves files with an extension of ".s". Please upload your program with that extension, not .cpp, .c, .m, .asm, or any other extension.

 

(5/5)
Attachments:

Expert's Answer

645 Times Downloaded

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

645 Times Downloaded

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

696 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

750 Answers

Hire Me
expert
Husnain SaeedComputer science

756 Answers

Hire Me
expert
Atharva PatilComputer science

668 Answers

Hire Me
June
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30