Answered: write a program that does the…

write a program that does the following: AL=9 AL++ X=AL Using 8086emu program check the status of registers, memory locations and flags write a program that does the

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

Please this question answered by this website but not appropriate answer because in c++ I want to answer in Assemly language to 8086 processor and 16 bit registers only Please solve it and send me please ? This question: Write a program to find the factors of a number and store the result at address 200 in memory.Sample Answer: I wrote a program to store factors of 60 at 200. (you should choose anynumber but greater than 20.WOLcUID wwreyg-100Ax-0060 BX=0030 CX-000 DX-0000 SP-0OFD BP=0900 SI=0000 DI-0209DS-073F ES-073P SS=073PF CS-973F IP-0110 NU UP EI PL ZR NA PE NC073F:011C CCd 2873F:020002 03 04 06 08 OC 10 18-20 00 00 00 00 00 00 00073F:0210 00 00 00 00 00 00 00 00-00 00 00 00 00 00 00 00973F:0220 00 00 00 00 00 00 00 0-00 00 00 00 00 00 00 00073F:0230 00 00 00 00 00 00 00 00-00 00 00 00 00 00 00 0873F :0240 00 00 00 00 00 00 00 0-00 00 00 00 00 00 00 00o73P:250 00 00 00 00 08 00 0 00-00 00 00 00 00 00 00 00073F873F:0270 00 00 00 00 00 00 00 00-00 00 00 00 00 00 00 00f 400 40c…
Using 8086 emulator
Assembly Lang. x86
code in java or c language
MIPS Simulator QtSpim: You are to have a complete program in MIPS assembly language that behaves exactly as the included C program. This program contains four functions in addition to the main() one. Your solution must contain all five C routines as they have been coded in the example. Make sure to run the program in MIPS and show the same output on MIPS as well to make sure there are no errors. Below is the five C routines and attached is the image of what the output must print out on QtSpim. #include <stdio.h> int getMax(int arr[], int n){int mx = arr[0];for (int i = 1; i < n; i++)if (arr[i] > mx)mx = arr[i];return mx;}void countSort(int arr[], int n, int exp){int output[n];int i, count[10] = { 0 };for (i = 0; i < n; i++)count[(arr[i] / exp) % 10]++;for (i = 1; i < 10; i++)count[i] += count[i - 1];for (i = n - 1; i >= 0; i--) {output[count[(arr[i] / exp) % 10] - 1] = arr[i];count[(arr[i] / exp) % 10]--;}for (i = 0; i < n; i++)arr[i] = output[i];}void…
MIPS Simulator QtSpim: You are to have a complete program in MIPS assembly language that behaves exactly as the included C program. This program contains four functions in addition to the main() one. Your solution must contain all five C routines as they have been coded in the example. Make sure to run the program in MIPS and show the same output on MIPS as well to make sure there are no errors. Below is the five C routines and attached is the image of what the output must print out on QtSpim. #include <stdio.h> int getMax(int arr[], int n){int mx = arr[0];for (int i = 1; i < n; i++)if (arr[i] > mx)mx = arr[i];return mx;}void countSort(int arr[], int n, int exp){int output[n];int i, count[10] = { 0 };for (i = 0; i < n; i++)count[(arr[i] / exp) % 10]++;for (i = 1; i < 10; i++)count[i] += count[i - 1];for (i = n - 1; i >= 0; i--) {output[count[(arr[i] / exp) % 10] - 1] = arr[i];count[(arr[i] / exp) % 10]--;}for (i = 0; i < n; i++)arr[i] = output[i];}void…
MIPS Assembly Write a program for RISC MIPS 32bits that challenges a person to guess a number of up to 3 digits before and 3 digits after the comma, that is, a value between 000,000 and 999,999. The program user will try to guess the number with multiple attempts, where the program will indicate at each attempt if the informed number is bigger, smaller, or if the user guessed correctly. When this happens, the program ends, showing a SUCCESS message and a total count of the number of attempts taken to get it right. The program must have a SUBROUTINE as described below. SUBROUTINE:- Input Parameters: user guess, expected value- Output: message on screen (bigger, smaller, SUCCESS)- Returns: value 1 if correct, 0 if incorrect
In MARIE assembly language: / This program reads a decimal array and outputs each/ number. The array is terminated with a zero./ Add the decimal numbers and store in sum and display sum at the end. ORG 100Get, LoadI ptr / Load the number found at address ptr.Skipcond 400 / If it is a zero, we are done.Jump Outp / Otherwise, proceed with operation.HaltOutp, Output / Output the number.Load ptr / Move pointer to next number.Add OneStore ptrJump GetOne, Hex 0001ptr, Hex 10BArray, Dec 072Dec 011Dec 018Dec 010Dec 119Dec 032Dec 110Dec 019Dec 000 Sum, Dec 000END
Patti the Programmer loads the EBX register with a pointer value as shown below: static: iValue: int16 := 0; begin progExample; mov(&iValue, EBX); // Patti uses [EBX] end progExample; After she has finished using EBX, must Patti the Programmer FREE EBX? Non of the choices listed are correct No Yes The answer will depend on the value of iValue
f R0 = 0x20008000, after executing STMIA r0!, {r3, r9, r7, r1, r2}, register r7 will be stored in memory starting from which bases. Please choose one:A. R0 = 0x2000800CB. R0=0x20008004C. R0= 0x20008014D. R0 = 0x20008010E. R0 = 0x20008008
write the following procedure using assembly 8086. FindDivisors: finds and displays all the divisors of N. You must optimize the loop to run as efficiently as possible. The value of N is passed to the procedure in EAX.
Programming Project: For Loops Write an Assembly Language Program that produces the Times Table for a specific integer value between 1 to 12. NOTE: You choose and hard code only one value (i.e. 7) and produce the times table for that value. Also note that since you are using registers and memory locations make sure that at each step you screen shot each result for each part of the Times Table. For example 7 x 12 = 84 but in Hexadecimal the value is 54. Sample code in C #include void main() ( int i, j; printf("Enter an integer: "); scanf("%d", &i); printf("Times %d Table\n", i). for(j = 0; j<= 12; j =j+1) { printf("%d x %d = %d\n", j, 1. j'i); } printf("\n");