LC-3. Please Write a program using Assembly to OR the values stored in R2 and R3, storing the result in R4 =========================== LDR R2 ; load R2 ADD R4, R2, R3 ; R4= R2 + R3 STR R4 ; store the result in R4 ======================= Requirements: Code will perform an “OR” operation “OR” will operate on data in Registers Values to be “OR”’s are loaded “by hand” into R2 and R3 before the program is run The result of “OR” is stored in R4

LC-3. Please Write a program using Assembly to OR the values stored in R2 and R3, storing the result in R4 =========================== LDR R2 ; load R2 ADD R4, R2, R3 ; R4= R2 + R3 STR R4 ; store the result in R4 ======================= Requirements: Code will perform an “OR” operation “OR” will operate on data in Registers Values to be “OR”’s are loaded “by hand” into R2 and R3 before the program is run The result of “OR” is stored in R4

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

1 .section .data 2 .section .text 3 .globl start 4 start: 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 31 32 pushq $4 pushq $3 call function-A addq $16, rsp movg %rax, %rbx movq $1, %rax int $0x80 .type function-A, @function function-A: pushq %rbp movą rsp, %rbp subq $8, rsp movg 16(%rbp), %rbx movq 24 (%rbp), rcx movq %rbx, -8(%rbp) label-A: #variable y #variable z cmpq $1, rcx je label-B mova -8 (%rbp), trax imulq %rbx, %rax movq rax, -8 (%rbp) decq rcx jmp label-A label-B: movq -8 (%rbp), trax movq rbp, rsp popq &rbp ret
Computer Science Recreate the following C program in aarch64 assembly: #include static void swap(long *a, long *b) { long temp = *a; *a = *b; *b = temp; } int main(void) { long a, b; scanf("%ld %ld", &a, &b); printf("Before swap: %ld %ld\n", a, b); swap(&a, &b); printf("After swap: %ld %ld\n", a, b); return 0; }
Below C-code has a for loop which will repeat 1000 times of the operation. This code will be running on very simple machine. Change the code to reduce the number of branch instructions. You can have up to 5 lines (statements) within the for loop. What is the number of branch operations before and after? for (i=0; i<1000; i++){ y[i] = w * x[i] + b[i]; }
Instruction: Explain the function of the program line by line thoroughly.Program: #include <iostream> using namespace std; //Swap functionvoid swap(int *xp, int *yp){ int temp = *xp; *xp = *yp; *yp = temp;} void selectionSort(int arr[], int n){ int i, j, min_idx; // One by one move boundary of // unsorted subarray for (i = 0; i < n-1; i++) { // Find the minimum element in // unsorted array min_idx = i; for (j = i+1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; // Swap the found minimum element // with the first element if(min_idx!=i) swap(&arr[min_idx], &arr[i]); }} //Function to print an arrayvoid printArray(int arr[], int size){ int i; for (i=0; i < size; i++) cout << arr[i] << " "; cout << endl;} int main(){ int x, n; cout << "Enter number of integers: "; cin >>n; int *arr = new int(n); for (int i = 0; i < n; i++) { cout << " Enter Integer No. " << (i + 1) << ": ";…
*Written in MASM Assembly 80x86 no c++ no python etc. allowed even if it supports** There will be a function called getdouble. This function will simply double any number which is currently in eax and store the result in eax. There will be a function called gettriple. This function will simply triple any number which is currently in eax and store the result in eax. There will be a function called getoddeven. This function will check if the value in eax is even. IF it is even, it will call the getdouble function. IF it is odd, it will get the gettriple function. (Note: edx stores remainder after you divide) Your main program should ask the first user for a name as well as for a number. You should then call the getoddeven function. That function will either double or triple the initial value entered by the user. Display the name and the final result for this first user. Your program will then do the same for a second user for a name as well as for a number. You will again call the…
Rewrite the code with local variables only and add trace tags to the code. BR main // branch to main loop x: .BLOCK 2 // storage for x Y: .BLOCK 2 // storage for y Temp: EQUATE 0 // set Temp=0 local variable #2d Main: LDWA 3,i // input i=3 STWA x,d //Store x LDWA 8,i // i=8 STWA y,d //store y SUBSP 2,i // subtract from stack pointer STWA temp,s //store word to stack LDWA x,d // Load word accumulator d to x STWA y,d // Store word accumulator d to y LDWA temp,S // Load word accumulator temp to stack STWA x,d // store d to x ADDSP 2,i // add to stack pointer STOP // stop execution .END
Problem Write an assembly program that prompts the user to enter a string of a size that does not exceed 20 characters and store it into a data variable wordListA using Irvine library's ReadString procedure. The program then displays the string entered by the user in reverse as shown in the sample run below. Sample Run > reverse.exe Enter a string (max 20 characters): word The reverse is: drow reverse.exe Enter a string (max 20 characters): BaB The reverse is: BaB > reverse.exe Enter a string (max 20 characters): sultan The reverse is: natlus > reverse.exe Enter a string (max 20 characters): abc123 The reverse is: 321cba > reverse.exe Enter a string (max 20 characters): &5%1772js The reverse is: sj2771%5& Your program must define and use the following procedure: Procedure reverseString: this procedure reverses the string that was read from the user by copying the characters from the defined data variable wordListA into wordListB starting from position at length-1 of wordListA and…
Using the C Programming language, write two versions of a function that contains a loop. Eachthe function should accept two numbers and calculate the sum of all numbers between the first numberand last number (inclusive of the first and last number). Once each function is writtenand tested for correct output, generate an assembly language version of the function. Write a version of the function using a while loop Write a version of the function using a goto loop Is the assembly language version of each loop function the same or different? (hint: Number of registers used Number of jumps (iterations), Total number of operations).
Use select to avoid deadlock goroutines and write go code
Example: The Problem Input File Using C programming language write a program that simulates a variant of the Tiny Machine Architecture. In this implementation memory (RAM) is split into Instruction Memory (IM) and Data Memory (DM). Your code must implement the basic instruction set architecture (ISA) of the Tiny Machine Architecture: //IN 5 //OUT 7 //STORE O //IN 5 //OUT 7 //STORE 1 //LOAD O //SUB 1 55 67 30 55 67 1 LOAD 2- ADD 3> STORE 4> SUB 5> IN 6> OUT 7> END 8> JMP 9> SKIPZ 31 10 41 30 //STORE O 67 //OUT 7 11 /LOAD 1 //OUT 7 //END 67 70 Output Specifications Each piece of the architecture must be accurately represented in your code (Instruction Register, Program Counter, Memory Address Registers, Instruction Memory, Data Memory, Memory Data Registers, and Accumulator). Data Memory will be represented by an integer array. Your Program Counter will begin pointing to the first instruction of the program. Your simulator should provide output according to the input file. Along with…
PROGRAM 15: Swapper Write an HLA Assembly language program that implements a function which correctly sorts three parameters and returns a boolean value in AL which should be set to true if any swaps were performed to sort the sequence in decreasing order. This function should have the following signature: procedure swapper (var x : int16; var y: int16; var z : int16); @nodisplay; @noframe; After invoking the function, the value of x >= the value of y >= the value of z. Your function must use reference parameters, changing the callers version of the variables passed to the function. Here is a sample program dialogue: Gimme X: 12 Gimme Y: 1 Gimme Z: 50 After sorting, X= 50, Y = 12, Z = 1 Gimme X: 100 Gimme Y: 10 Gimme Z: 2 After sorting, X = 100, Y = 10, z = 2
Electrical Engineering Consider a function called Vocals. This function has as parameter the starting address of a string of characters. The function calculates the number of times the 'a' character appears (in lowercase) in the string. In case of passing the mull string the function returns the value -1. In case the string does not have any 'a', the function returns 0. It is requested: 1. Program using the assembler 8086 the code of the Vocal function 2. Program using the ARM assembler the code of the Vocal function