ASM ASSEMBLY LANGUAGEX86RUN THE CODE AND POST THE SCREENSHOTWrite an assembly program to implement the following.sum = 0i = 0= 12varl = 3var2 = 3var3 = 0while ( (i < 20) and (j> -2)){if (varl > var3):varl =varl - ielse if (var2 < var3):var2 =var2 + jelse:var3 = var3+ isum = varl + var2+ var3i = i+1j = j-1Use short-circuit evaluationAssume that variables are 16-bit signed integers variablesYou are not allowed to make any logical reduction to the code. You need to implement it the way itis provided.Submit the following:Rename the asm file using your last name as Lastnamel.asm and submit it.Screenshot of the codeThen run the code until you reach INVOKE ExitProcess, 0Then take a screenshot of the watch window showing Sum variable content.

Answer: I have done code and also I have attached code as well as output.

Write an assembly program to implement the following. sum = i = 0 j = 12 varl = 3 var2 = 3 var3 while ( (i < 20) and (j> -2)){ if (varl > var3): varl =varl - i else if (var2 < var3): var2 =var2 +j else: var3 = var3+ i sum = varl + var2+ var3 i = i+1 j = j-1 %3D

Write an assembly program to implement the following. sum = i = 0 j = 12 varl = 3 var2 = 3 var3 while ( (i < 20) and (j> -2)){ if (varl > var3): varl =varl - i else if (var2 < var3): var2 =var2 +j else: var3 = var3+ i sum = varl + var2+ var3 i = i+1 j = j-1 %3D

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Science

A: The code is given as,

Q: Given an sorted array that contains both negative and positive integers. Write a c++ program that…

A: Lets see the solution in the next steps

Q: H H import random 3 def solution (a, b): intersection = [] length_a = len(a) length_b = len (b) i =…

A: Please refer below for your reference: The code in the above image is to first find two arrays and…

Q: Translate the following C program into Pep/9 assembly language. #include int minimum(int j1, int…

A: first, make the minimum function by passing two integer parameters in it then, make the main…

Q: Translate the following C program into Pep/9 assembly language: #include int main () { int width;…

A: The assembly code is: LC0: .string "%d %d" .LC1: .string "width = %d\n" .LC2: .string "length =…

Q: agment: int x = 20, p = 1, n; while (x >= 5){ n = 5; while (n = 5; x = x- 3) for(n = 5 ; n= 5; n= 5)…

A: Which of the code segment is equivalent to the given code? int x = 20, p = 1, n; while (x >=…

Q: Write an assembly language program that corresponds to the following C program: const int…

A: SYS_EXIT equ 1SYS_READ equ 3SYS_WRITE equ 4STDIN equ 0STDOUT equ 1AMOUNT equ 20000…

Q: Question 9 Na I need help with this homework question please. Analyze the following pseudocode and…

A: - We need to analyse the algorithm and give its Big-O notation.

Q: Consider the following java code: int var1 = 15; int var2 = 20; if (var1 >= var2){ else{ var1 = var1…

A: Introduction:- Assembly Language:- An assembly language is a type of low-level programming…

Q: 1. Consider the following two loops: / Loop A for (i - 1; i n; i+4) for (j - 1; j« 10000; j++) sum -…

A: 1. In the Loop A, outer for loop is executing n times and each time the inner for loop is executing…

Q: If f(n) is the number of times that y=y+A[i]; is executed in the code segment below, which of the…

A: The outer loop is for loop controlled by value of j The inner loop is while loop controlled by value…

Q: In N-version programming which is the independent generation of N, the value of N is a) greater…

A: Question. In N-version programming which is the independent generation of N, the value of N is a)…

Q: For a positive integer n, what is the value of the counter after the following code has been…

Q: C programming I'm trying to fix memory leak but it kept giving that one error. Where did I go wrong?…

A: Task : Given the code in C. The task is to debug the code and produce the output with

Q: Complete the TODO by finishing the accuracy() function. 1. Compute the total number of correct…

A: Complete the TODO by finishing the accuracy() function.1. Compute the total number of correct…

Q: 01 - Multiplication Times Table Print a multiplication times table from 0 to a user entered number…

A: Answer in step2

Q: Convert the following into Pep/9 Assembler: #include using namespace std; int square(int n){ int…

A: square(int): push rbp mov rbp, rsp mov DWORD PTR [rbp-20], edi…

Q: Output in C++

A: C++ PROGRAM:#include <iostream>void mystery(int x[], int n) {int temp; for(int i=0; i<n / 2…

Q: Convert the following into Pep/9 Assembler: #include using namespace std; int square(int n){…

A: Mnemonics used in this program: ADDSP: Add to stack pointer (SP). Memory allocated for local…

Question

ASM ASSEMBLY LANGUAGE
X86
RUN THE CODE AND POST THE SCREENSHOT
Write an assembly program to implement the following.
sum = 0
i = 0
= 12
varl = 3
var2 = 3
var3 = 0
while ( (i < 20) and (j> -2)){
if (varl > var3):
varl =varl - i
else if (var2 < var3):
var2 =var2 + j
else:
var3 = var3+ i
sum = varl + var2+ var3
i = i+1
j = j-1
Use short-circuit evaluation
Assume that variables are 16-bit signed integers variables
You are not allowed to make any logical reduction to the code. You need to implement it the way it
is provided.
Submit the following:
Rename the asm file using your last name as Lastnamel.asm and submit it.
Screenshot of the code
Then run the code until you reach INVOKE ExitProcess, 0
Then take a screenshot of the watch window showing Sum variable content.

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

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

If f(n) is the number of times that y=y+A[i]; is executed in the code segment below, which of the following is the correct big-Oh notation for f? y=0;for(j=0;j<n;j++) { for (i=0;i<n;i++) { y=y+A[i]; }} Group of answer choices O(1) O(n2) O(nlog2n) O(n)
Calculate the time complexity and represent by using asymptotic notation for the following code: int p=3, r=2; int f=1; for(int i=0; i
c) Estimate the time complexity for the following C++ program: //IIIII// Start //////////// #include void BSort(int A[n][n]) { int temp; for(int j=0 ; j A[i+1]) { const int n=10; int Fact (int); void BSort(int A[n][n]); int main() { int A[n][n]; for(int i=0;i>A[i][j]; temp=A[i]; A[i]=A[i+1]; A[i+1]=temp; } } BSort(A); cout<<"Factorial = "<
Debug my C code and translate the small code into assembly language. Thank you! #include <stdio.h> #include <stdlib.h> int Length = 4; int Seq[] = {17, 34, 51, 68}; int main() { int Next = 0; //Sets value for Next. int i = 1; // sets initial value for i. while (i != 4){ //condition for while loop. Next = Next + 17; //adds integer value to Next. i++; //post increment for @param i. return Next; //returns value for Next. } // your program should use this print statement printf("The next integer in the sequence: %d\n", Next); return 0; }
Write a program using Assembly to OR the values stored in R2 and R3, storing the result in R4 BEFORE ANYTHING, I been told that this works for the question, but I don't understand what it means - =========================== LDR R2 ; load R2 ADD R4, R2, R3 ; R4= R2 + R3 STR R4 ; store the result in R4 ======================= How is this implemented into assembly, and what should the whole code look like? previous answers are confusing 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 ------------------------------------------------------------------ Test Data set outputs: R2: xFF00 + R3: x00FF. R4 should = xFFFF R2: x1234 + R3: x4321 R4 should = x5335 R2: xF00D + R3: x0000 R4 should = xF00D
Write a parallel program for the following code /* PROGRAM Sieve */ #include <stdlib.h> #include <math.h> #define n 100 boolean Prime[n+1]; int i,num,loc; main( ) { for (i = 1; i <= n; i++) Prime[i] = TRUE; for (num = 2; num <= Sqrt(n); num++) if (Prime[num]) { loc = num + num; while (loc <= n) { Prime[loc] = False; } } loc = loc + num; }