• Write the assembly language code fragment that corresponds with the following high level language code fragment. You will need to use the SUB (subtract) instruction. If (A>B) OR (B=b) AND (b==c)) OR (a<=c) then a = b +c else a = b - c

• Write the assembly language code fragment that corresponds with the following high level language code fragment. You will need to use the SUB (subtract) instruction. If (A>B) OR (B=b) AND (b==c)) OR (a<=c) then a = b +c else a = b - c

Name: • Write the assembly language codefragment that corresponds with thef
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: • Write the assembly language codefragment that corresponds with thefollowing high level language codefragment. You will need to use the SUB(subtract) instruction.If (A>B) OR (B=b) AND (b==c)) OR (a<=c) thena = b + celsea = b - c

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 26VE: _____ is a CPU design technique in which instruction execution is divided into multiple stages and...

See similar textbooks

Similar questions

Write an armv7 assembly program that uses SUBROUTINE CALLING to compute the n-th term of the fibonacci sequence. The program must use recursive function calls. Here is the code in C associated to the function required to be implemented in armv7: int fibbonacci(int n) { if(n == 0){ return 0; } else if(n == 1) { return 1; } else { return (fibbonacci(n-1) + fibbonacci(n-2)); } } Pls comment your code as possible explaining exactly what happens. Thanks!
Microprocessor lab tasks - Solve the problems in assembly language using emu8086 solution format .MODEL SMALL .STACK 100H .DATA ; DEFINE YOUR VARIABLES HERE .CODE MAIN PROC MOV AX, @DATA MOV DS, AX ; YOUR CODE STARTS HERE ; YOUR CODE ENDS HERE MOV AX, 4C00H INT 21H MAIN ENDP END MAIN Collapse :white_tick: 1 Problems : Task 01 a program that takes in 3 digits as input from the user and finds the maximum Sample input: 1st input: 1 2nd input: 2 3rd input: 3 Sample Output: 3 Task 02 Take two digits as input from the user and multiply them. If the result is divisible by 2 and 3 both, print "Divisible". Otherwise, print "Not divisible" Sample input: 1st input: 5 2nd input: 6 Result is 30 Sample Output: Divisible Sample input: 1st input: 5 2nd input: 2 Result is 10 Sample Output: Not divisible
For a scenario of four floor lift write an assembly language code such that when user press any key from [1 till 4] lift should move to the corresponding floor. Code in assembly language microprocessor
Convert the given code fragment to assembly code fragment, using only instructions of the following types. These instructions are generally discussed in class. Here X,Y,Z are any memory locations; R, R1, R2 are any general registers; L is a label in the code (you can use any names as labels, ex. L, L1, L2 etc. ). load X, R //copy contents of memory location X into R. store R, X //Store contents of R into Mem location X cmp R1, R2 //Compute R1-R2 and update condition codes; //throw away result of subtraction. jmp L //Jump to location L in the code. jmpp L //If P bit is 1, Jump to location L in the code add X, R //Add contents of X,R and store result in R; //Also update the condition codes. Be careful about what type of argument is allowed in the instruction (Memory or Register). Ex. the first argument of ADD instruction is memory, not register. Do Not…
For the (pseudo) assembly code below, replace X, Y, P, and Q with thesmallest set of instructions to save/restore values on the stack and update the stackpointer. Assume that procA and procB were written independently by two differentprogrammers who are following the MIPS guidelines for caller-saved and callee-savedregisters. In other words, the two programmers agree on the input arguments andreturn value of procB, but they can't see the code written by the other person. procA:$s0 = ...$s1 = ...$s2 = ...$t0 = ...$t1 = ...$t2 = ...X$a0 = ...$a1 = ...jal procBY... = $s1... = $t0... = $t1... = $a0jr $raprocB:P... = $a0... = $a1$s2 = ...$t0 = ...Qjr $ra
turn this c code into assembly language in optimized and unoptimized mode. /* Project 2 */ /* GCC *//* gcc -Wa,-adhln -g -masm=intel -m32 "Project 2.c" > "Project 2-g.asm" *//* gcc -Wa,-adhln -O -masm=intel -m32 "Project 2.c" > "Project 2-o.asm" */ #include <stdio.h> #define NOINLINE __attribute__ ((noinline)) static NOINLINE int function1(int x, int y){ int i; int sum; int values[10]; sum = 0; for (i = 0; i < 10; i++) { values[i] = 10 * i + x * y; sum += values[i]; } return (sum); } static int NOINLINE function2(int *values, int valuesLen){ int i; int sum; sum = 0; for (i = 0; i < valuesLen; i++) { sum += values[i]; } return (sum); } static NOINLINE int function3(int x){ int y; y = x / 10; return (y); } static NOINLINE int function4(int a, int b, int c, int d){ int r; if (a > b) r = a; else if (a > c) r = 2 * a; else if (a > d)…
What are three applications of the.EQUATE instruction in Pep/9 assembly language? (explain briefly - each phrase should be one sentence) The.EQUATE command generates code for which of these three purposes?
2- What is the 8085 Assembly Language Instruction That do the follwing INITIALISE STACK pointer SP with value 250
Computer Science A[10] = x; Let x is saved in the register ($s0) and the base address of array A is saved in register ($s3). What is the equivalent MIPS instruction of this high-level language?
Write and simulate a MIPS assembly-language routine that: 1. Prints your group number, for example “Group 1”, 2. Computes the dot product of two vectors, A_vec and B_vec, as described in Lab 4 of the Lab Manual, 3. Stores the result at memory word DOTPROD, and 4. Prints the result preceded by the phrase: “The result of the dot product is: “. Your data segment should look like the following: .data group: .asciiz “\nGroup x” msg: .asciiz "\nThe result of the dot product is: " A_vec: .word x, 4, 20, 13, 3, 10, 5 B_vec: .word 4, 2, 1, 2, 5, 2, 4 n: .word 7 DOTPROD: .word 0 Replace each “x” with your group number.
Generate a listing file for AddTwoSum.asm(in 3.4.3 of the text) and write a description of the machine code bytes generated for each instruction. You can write your descriptions directly over the .lst file. You might have to guess at some of the meanings of the byte values. ; AddTwoSum.asm - Chapter 3 example. .386.model flat,stdcall.stack 4096ExitProcess proto,dwExitCode:dword .datasum dword 0 .codemain proc mov eax,5 add eax,6 mov sum,eax invoke ExitProcess,0main endpend main
I would appreciate it if you could clarify the terms "subroutine" and "stack" to me. Who makes use of the stack during calls to subroutines? The concept of calling and using subroutines, as well as the subsequent changes to the sequence in which programmes are performed, may be shown with the use of an example involving an 8085 microprocessor.