Assembly language is converted into executable machine code by a utility program referred to as an assembler; the conversion process is referred to as assembly or assembling the code. Assembly language uses a mnemonic to represent each low-level machine operation or op-code. The questions in this assignment deal with converting a high-level language into assembly instructions. Therefore, you need to know the instruction set and its structure. 1. For the following C code, what are the corresponding MIPS (Microprocessor without Interlocked Pipeline Stages) assembly instructions? X=(Y-Z)-(V+W) where V, W, X, Y, Z are assigned to registers $s0, $1, $s2, $s3, and $4, respectively. You may need temporary register(s) for this question. 2. For the following C code, what are the corresponding MIPS assembly instructions? B=C+A[7]; where (B) represented by $s0, C by $s1, and (A base address) represented by $$2 (temporary register(s) may be needed).

Assembly language is converted into executable machine code by a utility program referred to as an assembler; the conversion process is referred to as assembly or assembling the code. Assembly language uses a mnemonic to represent each low-level machine operation or op-code. The questions in this assignment deal with converting a high-level language into assembly instructions. Therefore, you need to know the instruction set and its structure. 1. For the following C code, what are the corresponding MIPS (Microprocessor without Interlocked Pipeline Stages) assembly instructions? X=(Y-Z)-(V+W) where V, W, X, Y, Z are assigned to registers $s0, $1, $s2, $s3, and $4, respectively. You may need temporary register(s) for this question. 2. For the following C code, what are the corresponding MIPS assembly instructions? B=C+A[7]; where (B) represented by $s0, C by $s1, and (A base address) represented by $$2 (temporary register(s) may be needed).

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

Similar questions

Dynamic Versus Stack Allocated Memory Describe by example and words the difference between dynamic and stack allocated memory, specifically arrays. How they are created and destroyed, and describe their scope. Are there any limitations with either memory types? Lastly, has modern C++ provided any new features (hint: standard template library data types) to alleviate problems associated with dynamic and/or stack allocated memory?
80x86 Intel Assembly language Write an assembly language to declare all the variables needed in the following instructions and initialize them with a value of your choice. Then write assembly language code to perform the following C instruction. int number1; int number2; int number3; int number4; number1 = -number2 + (number3 - number4) if (number1 > number3) number1 = number2; else number1 = number3;
28. Write a Pep/9 assembly language program that corresponds to the following C program: char ch; int main () { scanf("%c", &ch); ch--; printf("%c\n", ch); return 0; }
B1: Implementing Arithmetic Expression ( i ) Armed with the ADD, SUB, and NEG instructions, we have the means to implement arithmetic expressions involving addition, subtraction, and negation in assembly language. In other words, we can simulate what a C++ compiler might do when reading an expression such as Rval = -Xval + (Yval - Zval); Based on the above arithmetic expression, we can construct the assembly program by the following steps: The following signed 32-bit variables will be used: Rval SDWORD ? Xval SDWORD 26 Yval SDWORD 30 Zval SDWORD 40 When translating an expression, evaluate each term separately and combine the terms at the end. First, we negate a copy of Xval: ; first term: -Xval mov eax, Xval neg eax ; EAX = -26 Then Yval is copied to a register and Zval is subtracted: ; second term: (Yval - Zval) mov ebx, Yval sub ebx, Zval ; EBX = -10 Finally, the two terms (in EAX and EBX) are added: ; add the terms and store: mov Rval, eax add Rval, ebx ; Rval = -36…
s. Convert the following C code to assembly language using vector operations. (Just do your best, make necessary assumptions, don't worry about syntax too much.) for (i-0;i <300; i++) { c_re[i] = a_re[i] b_re[i]-a_im[i] * b_im[i]: c_im[i] - a_re[i] b_im[i]+a_im[i] * b_re[i];
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…
PLEASE DON'T USE STRUCTS Using C programming language write a program that simulates a variant of the Tiny Harvard 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 TinyMachine Architecture: 1 -> LOAD 2->ADD 3->STORE 4 -> SUB 5 ->IN 6-> OUT 7-> END 8 -> JMP 9 -> SKIPZ Each piece of the architecture must be accurately represented in your code (Instruction Register, Program Counter, Instruction Memory (IM), MAR1, MDR-1(MAR-1 and MDR-1 are connected to the IM). Data Memory, MAR-2, MDR2 (MAR-2 and MDR-2 are connected to the DM), and Accumulator. Instruction Memory will be represented by an integer array and each instruction will use 2 elements of the array(one for OP and the other one for address) Data Memory will be represented by an integer array and each data value uses an element of the DM array. Your Program Counter will begin pointing to the first…
1. Translate the following C++ expression to assembly language, using the example presented earlier in this chapter as a guide:X = (Y * 4) + 3 2.Statements at the assembly language level of a virtual machine are translated into statements at which level? 3.
What advantage is gained from allowing a given C program to vary in execution behavior from one computer architecture to another? Give three common example variations. What is the disadvantage of variation?
Task Write a program in the ARMLite assembly language which generates the Fibonacci number F(12) and stores the value in register R6. • You must use a loop to generate the value. Partial marks will be given for otherwise correct but non-loop based solutions • There is no limit on the number of registers you can use • The stack memory may be used, but is not required • Other memory access is not allowed or needed • Add a comment to the top of your program describing it's behaviour. You should make use of comments to describe your code's sections. Submit your program as a plain text file. If you are using the ARMLite simulator, it can be exported directly using the 'Save' button.
Pls answer this question in assembly language code. Not in pcsudo code. I am really confused and dont really understabd how to do it! Thank you so much! pls use https://wchargin.com/lc3web/ to excutue code and to test it thank you! here is the psudeo code for help hopefully it is correct! but make the code into assembly code. 2. .FILL i .FILL max for (i = 0; i < max; i++) { R3 = R3 + 5 } .END 3. .FILL RO while (RO > -10) { RO = RO - 2 } .END
E In the following code block(Reference:Q11), you will a set of assembly instructions with corresponding line numbers (line numbers are for informational purpose only and they are not part of the source code). 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 mov edx, 5 dec ecx jmp LABEL1 mov eax, 1 LABEL1: mul edx jmp ecx mov edx, 0678h sub edx, eax jmp DWORD PTR [edx] neg ebx add ecx, ebx mov eax, 0 For each of the conditions/scenario listed below, indicate the corresponding line number (that cause or is associated with the condition/scenario). Enter 0 (Zero) if the condition is not caused by the block of code. 1) Memory indirect jump: type your answer... type your answer... type your answer... type your answer... 2) Register indirect jump: 3) Relative short jump: type your answer... 5) Two's complement type your answer... 4) Relative near jump: 6) Unreachable code