me you are given an array of four 16-Bit humbers stored in with a sta Using PL- elative addressing, write an LC-3 machine language program that will copy the same four 16-bit numbers in reverse rder, starting at memory address x3120. For example, if the following are the four 16-bit values stored in x3110, x3110 12 x3111 23

me you are given an array of four 16-Bit humbers stored in with a sta Using PL- elative addressing, write an LC-3 machine language program that will copy the same four 16-bit numbers in reverse rder, starting at memory address x3120. For example, if the following are the four 16-bit values stored in x3110, x3110 12 x3111 23

Name: Assume you are given an array of four 16-bit numbers stored in memory
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Assume you are given an array of four 16-bit numbers stored in memory with a starting address x3110. Using PC-relative addressing, write an LC-3 machine language program that will copy the same four 16-bit numbers in reverseorder, starting at memory

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: adres veri 01h 5x9 02h 5x8 190100 7155 08h 871580 5x2 09h 5x1 Write the asm code that will create…

A: F000 21, 50 F0 LXI H,F050H memory location where number is stored F003 46 MOV B,M the number…

Q: What is the final value of BX after the bitwise OR instruction executes? MOV BX, 649BH OR BX, 3Ah…

A: We are asked the final value of BX after the bitwise OR instruction executes. OR operation gives 1…

Q: Modify the following program in lc-3 to get the input(numbers) from the keyboard and print the…

A: An assembler program which creates the object code by the translating and also it is the…

Q: The Fibonacci equation can be given as: F = F2 1 and the recurrence is Fn = Fn-1+ Fn-2 %3D %3D п-1…

A: Answer: #include<stdio.h> #include<conio.h> int main() //execution starts from here {…

Q: If we store the following array of 1-byte values at memory address 0x54, what is the memory address…

A: Since array indexing starts from 0, arr[3] refers to the 4th element which is stored in the array…

Q: Let's say that p is a pointer to memory and the next four bytes in memory (in hex) beginning at p's…

A: In little endian computer the data is stores as least significant byte first. if there is a number…

Q: Suppose we store an array of two 32-bit numbers {0x12345678, 0x9ABCDEF0} starting at memory address…

A: Little endian: In little endian, the least significant bytes are stored first. Example: 0x34256792…

Q: Use immediate addressing with a character constant (a single character value) to designate the…

A: The program is to print a Name on the screen. Suppose I want to print "JOHN" ,in PEP 9 Architecture,…

Q: 21. Write an assembly language program that prints your first name on the screen. Use immediate…

A: The program is to print a Name on the screen. Suppose I want to print "JOHN" ,in PEP 9 Architecture,…

Q: 4. Write a subroutine to set bits 6, 4, and 2 of every element in an array in data memory. array…

A: Input : Array to the subroutine Output : Values set at position 6 , 4 and 2.

Q: REVERSE 8 BYTES NUMBER WITH MOV ONLY: We have an 8 bytes width number, so we save the lower bytes in…

A: reverse:bswap eax ; Reverse the bytes of eax. So now eax becomes 15141312hbswap edx ; Reverse the…

Q: Write a MIPS Assembly Language program to request and read the equation parameters A, C, M, and X0.…

A: The following is the MIPS assembly language program :

Q: Assume that addresses of word arrays A and B are stored in registers $50 and $s1, and variable i is…

A: We have to create the MIPS code for the following code- A[i]= 16 x B[i-1]

Q: Suppose we number the bytes in a w-bit word from 0 (least significant) to w/8 −1 (most…

A: ANSWER:

Q: Suppose we store an array of two 32-bit numbers {0x12345678, 0x9ABCDEF0} starting at memory address…

A: This is machine language related question. Answer is in step 2.

Topic Video

Question

Assume you are given an array of four 16-bit numbers stored in memory with a starting address x3110. Using PC-
relative addressing, write an LC-3 machine language program that will copy the same four 16-bit numbers in reverse
order, starting at memory address x3120. For example, if the following are the four 16-bit values stored in x3110,
x3110
12
x3111
23
х3112
34
х3113
45
then the result of your program execution should write the following starting at memory address x3120:
x3120
45
х3121
34
x3122
23
x3123
12
Load your program starting at address x3100. You will need to demonstrate the correct execution of your program by
using the LC-3 Simulator.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Write a MIPS assembly program to perform signed multiplication of 32-bit numbers using thealgorithm studied in class. The program should ask the user to inter two integers and then display theresult of multiplication. If the result cannot fit in 32-bit then the program should indicate that there isoverflow. Test your program using the following numbers:1. -1 x -12. 100 x -23. 0 x 104. 2147483647 x 2
Suppose we number the bytes in a w-bit word from 0 (least significant) to w/8 – 1 (most significant). Write code for the following C function, which will return an unsigned value in which byte i of argument x has been replaced by byte b: unsigned replace_byte (unsigned x, int i, unsigned char b); Here are some examples showing how the function should work: replace_byte(0x12345678, 2, 0xAB) --> 0x12AB5678 replace_byte(0x12345678, 0, 0xAB) --> 0x123456AB Bit-Level Integer Coding Rules In several of the following problems, we will artificially restrict what programming constructs you can use to help you gain a better understanding of the bit-level, logic, and arithmetic operations of C. In answering these problems, your code must follow these rules: Allowed operations All bit-level and logic operations. Left and right shifts, but only with shift amounts between 0 and w – 1. Addition and subtraction. Equality (==) and inequality (!=) tests. (Some of the problems do not allow…
Write out how to solve the following code using any addressing mode for (3,3) GPR. a[] is address0x100, y is address 0x300, z is address 0x400, and x is using r0. Write comments besides each line ofcode. Short a[50];Int y,z;for( x=0; x<20; x++){y = a[x + 3];z = y + a[x+10];}
i have this code .ORIG x3000SetupLEA R0, InfoPUTS ADD R6, R6, #5; Init Main Loop counter (loop 5 times) ;Print first 2 Fib values before starting;----- Your Code Here -----;LD R1, #0 JSR printNum LD R2, #1 JSR printNumJSR printNum ; Print the value in R2 JSR printCommaSpace ; Print comma and space ;----- End Your Code Here -----;;Loop and call subroutines to calculate each subsequent value in the sequence;Exit the loop once all single-digit values in the sequence have been printedMainLoop ;----- Your Code Here -----; JSR calcNextFib JSR printNum JSR printCommaSpaceADD R6, R6, #-1BRz Done BR MainLoop ;----- End Your Code Here -----; Done HALT ;-----------------------------------;Subroutines;----------------------------------- ;Uses R1 and R2 to calc next value in Fibonacci sequence;When complete, Fib2 (R2) will contain the new Fib number;and Fib1 (R1) will contain the previous value of Fib2 (R2)calcNextFib;----- Your Code Here -----;ST R1, SaveR3 ; Save R1ST R2,…
Write a C99 program compiled with GCC on the RPi 3b/3b+ that uses two 8-bit unsigned integers (uint8_t) variables named “a” and “b”. The initial value of a=0 and b = 6. The program should contain a single for loop that increments the “a” variable a total of 512 iterations (the counter will repeat in the middle). The program should output 512 values in the format below:a a == b a < b a > b0 0 1 01 0 1 0....While the C program uses a 8-bit integer and the hardware circuit uses a 4-bit integer, the modulo nature of the counter is the same. The comparator operation isalso the same.
Using MIPS assembly language, write a MIPS programs that the determines what the ECC code should be for a given number (an 8-bit byte).The codes you create are to work for 8-bit positive numbers as these are simpler to work with than larger numbers. The program is to request the user to enter a byte of data (a positive integer in the range of 0 to 255 in decimal) and then create the 12-bit Hamming code as described in your text (see above). The program is to then output this (with an appropriate label) in hex. the following code is not working and has errors: # Prompt user for inputli $v0, 4 # system call for printing stringla $a0, prompt # prompt stringsyscall # Read input byteli $v0, 5 # system call for reading integersyscallmove $t0, $v0 # store the byte in register $t0 # Calculate ECC Hamming codesrl $t1, $t0, 4 # extract the first 4 bitsxor $t1, $t1, $t0 # calculate parityand $t1, $t1, 0b1011 # mask out irrelevant bitssll $t1, $t1, 8 # shift left by 8 bitssrl…
Assume you now have 1kB of memory, i.e. the memory address space runs from 0 to 1023. The starting address of the first word is 0, the second word is 4, the third word is 8, and so on. The last word comprising 4 bytes resides in addresses 1020, 1021, 1022, 1023. Thus, the last word starts at 1020, which is a multiple of 4. Now assume the same 1kB of memory but now, word size is 64 bits. The starting address of the first word is 0, the second, third, and last word starts at? my answer: (correct) the second is equal to = 8 the third is equal to = 16 help me find the last word
Question/ program give below run on 8086 used to add two 32-bit number. Fill the missing code to store the result immediately in location start with 3004? 3000 12 4000 | 12 3004 | 24 3001 11 4001 | 10 3005| 21 3002 02 4002 | 21 3006 | 23 3003 | 0L 4003 | 04 3007 05 Mov AX.3000h Fig (1) memory data segment Mov DS, AX Mov AX,4000 Mov ES, AX Mov S0000k, Mov DL0000k Mov CX.04h NEXT: Mov AX, [ST] Mov BX, (DI} ADD AX, BX
Write an ALP to generate a bill for 6 items purchased in a LULU hypermarketwhose prices are represented as BCD numbers 12h ,14h,18h,22h and 35h and 42hOMR. Save the bill amount in the memory address 8500h
You are to write an Intel x86 assembly language program which makes useof a loop to access the individual elements of the array containing the ASCIIcharacters. You are to initialize the array with the following db directive: message db 'juMping JAck flaSh #1',10, 0 The ASCII character represented by decimal value 10 (0x0A) is the line feedcharacter (similar to endl in C++). The byte with all zeros (the so called NULL character in ASCII) is used to represent the end of the string. Before entering the loop, which performs the case conversion, the program is to display on the screen the (original) contents of the string. Within the loop, the program is to determine whether the current character represents a lower case character. If the character is lower case, it is to be converted into its uppercase version. Non-alphabetic characters are to remain as is. Upon convertingall the lower case characters, the program is to display the string on the screen. Here is an example of a correct…
Consider two integer arrays B and D of 100 elements. Let X2 and X3 contain the base address of array "B" and "D", respectively, and the index į is in X0, h is in X10. Write LEGV8 code to perform the following operations: (a) Get B[15] from memory and put it in register X5. (b) Put the value 132 in D[6]. (c) Translate the following C code into LEGv8 instructions int j = 50, h; do { D[2*j] = (B[j] + B[j+2])*9 - h; j^j -2; while {j >0}; DO NOT use multiply instruction in your code, use shift instruction for multiplication instead! (d)How many instructions are executed during the running of the code in (c), and how many memory data references are made during executio'n?
Suppose we store an array of two 32-bit numbers {0x12345678, 0x9ABCDEF0} starting at memory address 0x100. If we stored this big-endian, which byte of our data would be stored at memory address 0x104 ? A. 9A B. 12 C. FO D. 78 O E. None of the above (or N/A)