Question 1

A block of memory contains 50 random words of data. Assume that the values are in

two’s complement representations and are stored in the R/W memory area. You need

to provide the 50 random words and to include them in an initialization file: assign2.ini.

Write a program using the ARM assembly programming language to do the following:

- a) You are required to reverse the word order in a block of 50 random words (Hint:

the last word stored in the memory becomes the first and vice versa).

- b) Next, find the minimum and maximum value in the 50 random words of data.

Question 2

- a) Write a subroutine using the ARM assembly programming language to construct

tables of 20 (n = 0, 1, 2, …, 19) 32-bit data. There are 2 inputs to the subroutine.

One is an option and the other is the starting address of the table to be constructed.

There are 2 possible options: 1 or 2. This option will dictate how you should

construct the table. This is shown as followed:

option = 1: Build a table of an arithmetic sequence numbers. This sequence has

a difference of 3 between each number. The pattern is continued by

adding 3 to the last number each time, like this: 1, 4, 7, 10, 13, 16,

19, 22, 25, ... Assume that the first number is 1.

option = 2: Build a table of a geometric sequence numbers. This sequence has

a factor of 3 between each number. The pattern is continued by

multiplying by 3 to the last number, like this: 1, 3, 9, 27, 81, 243, ...

Assume that the first number is 1.

- b) Write the main program using the ARM assembly programming language to call

the subroutine written in part (2a). The main program needs to provide the 2 inputs

to the subroutine: an option and the starting address of the table to be constructed.

Hint: you need to use the key concepts of table generation, jump table and subroutine.

Assembly Programming

94 Answers

Assembly Programming

62 Answers

DescriptionIn this final assignment, the students will demonstrate their ability to apply two majorconstructs of the C programming language – Functions and Arrays – to solve computationalproblems.Arrays provide a convenient way to store &

The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is anPath 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 through certain obstacles. As the main aim is to thinkabout path finding, we focus on the common task

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 individualDevelop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. TheLineItem class will represent an individual line item of merchandise that acustomer is purchasing.

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 Sea Ports. Here are the classes and their instance variables we wish to define: SeaPortProgram e

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 Sea Ports. Here are the classes and their instance variables we wish to define: SeaPortProgram e

The first programming project involves writing a program that parses, using recursive descent, a GUI definition language defined in an input file and generates the GUI that it defines. The grammar for this language is defined below:1Project 1The first programming project involves writing a program that parses, using recursive descent, a GUIdefinition language defined in an input file and generates the GUI that it defines. The grammar for thislanguage is defined below:gui ::= Wi

CMSC 335 Project SeaPort Solved Project 3 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 PortsCMSC 335 Project SolvedProject 3 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:

CMSC 335 Project 4 Solved SeaPort 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 defineProject 4 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: SeaPortProgram ext

CMSC 451 Project 2 Solved The second project involves completing and extending the C++ program that evaluates statements of an expression language contained in the module 3 case studyProject 2 The second project involves completing and extending the C++ program that evaluates statements of an expression language contained in the module 3 case study. The statements of that expression language consist of an arithmetic expression f

CMSC 451 Project 1 Solved The first project involves benchmarking the behavior of Java implementations of one of the following sorting algorithms bubble sort selection sort insertion sort Shell sort, merge sort quick sort or heap sortCMSC 451 Project 1The first project involves benchmarking the behavior of Java implementations of one of thefollowing sorting algorithms, bubble sort, selection sort, insertion sort, Shell sort, merge sort,quick sort or heap sort. You must post your

The ready solutions purchased from Library are already used solutions. Please do not submit them directly as it may lead to plagiarism. Once paid, the solution file download link will be sent to your provided email. Please either use them for learning purpose or re-write them in your own language. In case if you haven't get the email, do let us know via chat support.

Get Free Quote!

252 Experts Online