5. Given the following "Super Simple CPU" program: LDI 6 SUB ONE ADD TWO DONE STO ONE STP DAT 1 DAT 2 ONE TWO b. ; Load 6 into accumulator ; Subtract the value in memory location ONE from accumulator ; Add the value in memory location TWO to accumulator ; Store accumulator in memory location ONE ; Stop the program ; A data value, the constant 1 ; A data value, the constant 2 Trace the code, write the values of Accumulator, Memory (ONE), and Memory (TWO) in a table (sample table is shown below), and record their changes after each instruction. Assembly instruction Accumulator ONE TWO LDI 6 6 1 2 Write a pseudocode that performs the same program.

5. Given the following "Super Simple CPU" program: LDI 6 SUB ONE ADD TWO DONE STO ONE STP DAT 1 DAT 2 ONE TWO b. ; Load 6 into accumulator ; Subtract the value in memory location ONE from accumulator ; Add the value in memory location TWO to accumulator ; Store accumulator in memory location ONE ; Stop the program ; A data value, the constant 1 ; A data value, the constant 2 Trace the code, write the values of Accumulator, Memory (ONE), and Memory (TWO) in a table (sample table is shown below), and record their changes after each instruction. Assembly instruction Accumulator ONE TWO LDI 6 6 1 2 Write a pseudocode that performs the same program.

Name: 5. Given the following "Super Simple CPU" program:ADD TWODONE STO ONE
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 5. Given the following "Super Simple CPU" program:ADD TWODONE STO ONESTPONETWOa.LDI 6SUB ONEb.DAT 1DAT 2; Load 6 into accumulator; Subtract the value in memory location ONE fromaccumulator; Add the value in memory location TWO to accumulator; Store

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

Write programs that will accomplish the desired tasks listed below, using as few lines of code as possible.Use only opcodes that have been covered in class. Comment on each line of code. m) Copy the external code byte at address 007Dh to the SPn) Copy the data in register R5 to external RAM address 032Fho) Copy the internal code byte at address 0300h to external RAM address 0300hp) Swap the bytes in TIMER 0 ; put TL0 in TH0 and TH0 in TL0q) Store DPTR in external RAM locations 0123h (DPL) and 02BCh (DPH)r) Exchange both low nibbles of registers R0 and R1 ; put the low nibble of R0 in R1, and the lownibble of R1 in R0s) Store the content of register R3 at the internal RAM address contained in R2. (Be sure the addressin R2 is legal)t) Store the content of RAM location 20h at the address contained in RAM location 08hu) Store register A at the internal RAM location address in register A
calculate the number of memory bytes accessed by this program: void my_dgemv(int n, double* A, double* x, double* y) { double alpha=1.0, beta=1.0; int lda=n, incx=1, incy=1; cblas_dgemv(CblasRowMajor, CblasNoTrans, n, n, alpha, A, lda, x, incx, beta, y, incy); }
Write programs that will accomplish the desired tasks listed below, using as few lines of code as possible.Use only opcodes that have been covered in class. Comment on each line of code. s) Store the content of register R3 at the internal RAM address contained in R2. (Be sure the address in R2 is legal) t) Store the content of RAM location 20h at the address contained in RAM location 08h u) Store register A at the internal RAM location address in register A v) Copy program bytes 0100h to 0102h to internal RAM locations 20h to 22h w) Copy the data on the pins of port p2 to the port 2 latch x) PUSH the contents of the B register to TMOD y) Copy the contents of external code memory address 0040h to IE z) Show a set of XCH instructions executes faster than PUSH and POP when saving the contents of the A register.
Consider the following C++ code snippet: int cards[3]; for (int i = 0; i < 3; i++) cards[i] = 0; Choose the best statement: A) This code will compile and run but causes an out-of-range memory write. B) This code will compile and has no apparent issues. C) This code will not compile as written. D) This code shows an example of dynamic memory allocation.
Create a three address statement and convert the three address statement into machine code fromthe following snippet of program input:int i, a, b;a=0;b=0;for (i=10; i>0; i=i--){if (a%2 ==0 && a<b) b = b + 4;else b = b + 5;}
analyze each program and figure out what is wrong with the memory management in the code and how to fix the code. #include <unistd.h>#include <stdio.h>#include <stdlib.h>#include <assert.h> // Hint: If you run this program repeatedly, with ever-larger numbers as input,// eventually something (slightly) unexpected should happen.intmain(int argc, char *argv[]){if (argc != 2) { fprintf(stderr, "usage: broken2 <value>\n"); exit(1); } int size = atoi(argv[1]);int *p;p = malloc(size*sizeof(int));for (int i = 0 ; i < size; i++) {p[i] = i;}int *q;q = malloc(sizeof(p));for (int i = 0 ; i < size; i++) {q[i] = p[i];} free(p);free(q);return 0;}
Hello I need help with the following question, I have provided my work that I have done and an example of completed work from the class. This is the question I need help with. A system currently accessing 3.8 G bytes of RAM and 10 M bytes of ROM. Compute the number of address lines required to access the designated storage. For a given # of lines how many more storage space is accessible? Currently out of 3.8 G, 3 G is used by the system programs, .4 G by an application. Can we expand the memory by another 890 M to support a new application? show total storage use and available. Show all your work.
You are required to make changes in the below programs and introduce the use of compaction where required. #include<stdio.h> #include<conio.h> main() { int ms, bs, nob, ef,n, mp[10],tif=0; int i,p=0; clrscr(); printf("Enter the total memory available (in Bytes) -- "); scanf("%d",&ms); printf("Enter the block size (in Bytes) -- "); scanf("%d", &bs); nob=ms/bs; ef=ms - nob*bs; printf("\nEnter the number of processes -- "); scanf("%d",&n); for(i=0;i<n;i++) { printf("Enter memory required for process %d (in Bytes)-- ",i+1); scanf("%d",&mp[i]); } printf("\nNo. of Blocks available in memory -- %d",nob); printf("\n\nPROCESS\tMEMORY REQUIRED\t ALLOCATED\tINTERNAL FRAGMENTATION"); for(i=0;i<n && p<nob;i++) { printf("\n %d\t\t%d",i+1,mp[i]); if(mp[i] > bs) printf("\t\tNO\t\t---"); else { printf("\t\tYES\t%d",bs-mp[i]);tif = tif + bs-mp[i]; p++; } } if(i<n) printf("\nMemory is Full, Remaining Processes cannot be accomodated"); printf("\n\nTotal…
Suppose the following code: int a, b, c;char array[100];void f(int& val){char* arr = new char[100];for(int i = 0; i < val; ++i){arr[i] = i*i;}}int main(){int myValue = 123;f(myValue);return 0;} Think about which section of process memory each part of this program would occupy during execution. Then, match items on the left with their storage locations on the right.
THIS IS FOR PYTHON LANGUAGE To do the upgrade, according to Microsoft, a computer needs to have at least 1GB of memory, and at least 1GHz processor, and either Windows 7 or Windows 8 currently installed. All three requirements must be met. Other operating systems do not meet the requirements. Write a program that asks the user for The current memory in their computer, in GB. (For example, a user with 8GB of memory would enter 8) The current processor speed, in GHz. (For example, a user with a 2.6GHz processor should enter 2.6) The name of their current operating system. (For example, a user could enter Windows 8 or Windows 7 or Windows XP or Linux or MacOS...) Write a can_upgrade function that takes three arguments, the amount of memory, the processor speed, and current operating system. In can_upgrade, use conditions to figure out if the user's computer can be upgraded to Windows 10 or not. Your function should return one of the Boolean values True (if the computer can be…
We will use Venus RISC-V simulator for the lab. Please save screenshot of code and output Based on fib.s, please rewrite the code to print full Fibonacci sequence to the console. For example, if n = 5, print 0, 1, 1, 2, 3. Test your program by varying n. Please save the screenshot of the two following test cases: 1) n = 10 2) n = 18 Save your code as task1.s. Here is the fib.s: .data .word 2, 4, 6, 8 n: .word 9 .text main: add t0, x0, x0 addi t1, x0, 1 la t3, n lw t3, 0(t3) fib: beq t3, x0, finish add t2, t1, t0 mv t0, t1 mv t1, t2 addi t3, t3, -1 j fib finish: addi a0, x0, 1 addi a1, t0, 0 ecall # print integer ecall addi a0, x0, 10 ecall # terminate ecall
Interestingly some numbers can be perfectly represented in Base 10, but not in Base 2. An example is one-tenth (in Base 10, this is 0.1; in Base 2 this is a repeating decimal. Suppose we set both f and g to one-tenth using the statements below. f = 0.1; g = 0.1; Answer the following questions. For each, mark the best answer. Which will be closer to the actual value of one-tenth? f g Which can hold higher values? f g Which takes more memory? f g When using real values I should always use type double, to be safe. True False