10) Functions in high-level languages often declare local variables just below the return address on the stack. Write an instruction that you could put at the beginning of an assembly language subroutine that would reserve space for two integer doubleword variables. Then, assign the values 1000h and 2000h to the two local variables.

10) Functions in high-level languages often declare local variables just below the return address on the stack. Write an instruction that you could put at the beginning of an assembly language subroutine that would reserve space for two integer doubleword variables. Then, assign the values 1000h and 2000h to the two local variables.

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

Example: translate the following C statement to assembly language and machine code. x-y*(y+z); Assume x,y and z are stored in memory locations 0,1 and 2 and there are general purpose registers called A,B,C...etc
Q10. State the difference between Assembly language and Machine Language. Q11. Write a program to exchange BC & DE register pair using Intel 8085 CPU stack. Q12. Say what the following program does: Start: LDA 4000H LOOP: ADD A, A CPI EFH JC LOOP STOP: STA 4000H HLT Q13. What this program does: Start: LXI SP, 5000H PUSH PUSH D POP B POP D HLT Q14. When pushing a register pair to the stack: a- SP register gets decremented by 2. b- SP register gets incremented by 2. c- SP register gets decremented by 1. d- SP register gets incremented by 1. e- None of the above. Q15. To exchange contents of DE & BC register pair using the stack, we should: a- Push D followed by Push B then pop B followed by pop D. b- Push D followed by Push E then pop B followed by pop D. Push B followed by Push D then pop B followed by pop D. d- Push C followed by Push B then pop B followed by pop E. C- e- None of the above. Q16. WR & RD pins are active low output from the CPU: a- When RD pin is 0, it means data bus is…
Please write the lines that the code will print out. Assume the following addresses: - a in main has the address 1000-b in main has the address 1004 c in main has the address 1008 - d in main has the address 1012 - b in fooA has the address 2000 - a in fooA has the address 2008 int fooA (int* b, int& c, int a) { (*b) ++; c+ = 2; a + = 4; cout <<<<<<' <<<&Q<<< ""«a« ""<< b<< "" <<
3. Create an 80x86 ASSEMBLY LANGUAGE program that define an array of doubleword numbers then read twovalues, first one indicates how many actual numbers will be in the array, and an integer n. Theprogram should display all of the numbers in the array that are greater than the number n. MUST PROVIDE FULL CODE AND SCREENSHOT OF OUTPUT PLEASE
2) Write the following code segment in MARIE's assembly language. If X >= Y then X = X * 2 else Y = X - Y + Z;
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…
10.- Consider the following code and pictureLoop1MOVLW 0x32MOVWF REG2DECFSZ REG2,FGOTO LOOP1 If the system clock frequency is aMHz and each machine cycle consumes 4 cycles of it. Calculate the delay time of the LOOP1 loop. Include the execution difference time of the DECFSZ instruction in the last cycle. Select an answerA) 0.6.sB) 6msC)6usD) 60us
Microprocessors Fill in the following blanks with appropriate answers 4. If there is a carry from lowest nibble during addition, …………. flag sets.5. …………. register is used as a default counter in case of string and loop instructions.6. In PUSH instruction, after each execution of the instruction, the stack pointer is
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…
Convert the following C++ program into an x86 assembly language program.Comment the start of each "code block" that performs one of the listed mathematical calculations.Comments go to the right of the actual code, all starting on the same column.Post ONLY your ASM file here to Blackboard when complete. // Global variableschar a = 5;char b = 6;char c = 7;char d = 8;char e = 2;char f = 3;char g = 1;char h = 4;// Codeint main(){ --h; c = g + h; d = e + 22 - c - b; g = -h; ++b; a = g + d - 15; b = a + 92 - b; h = d + (-f) - d; // Move a into the eax register // Move b into the ebx register // Move c into the ecx register // Move d into the edx register // Call the DumpRegs function // Move e into the eax register // Move f into the ebx register // Move g into the ecx register // Move h into the edx register // Call the DumpRegs function e = e - 6; g = 126; --a; b = 15 - e + f; c = -f; d = -h + g - a; e = a…
1. Translate the following algorithm to this simple computer's assembly language and then to machine language. (use the columns in a table as shown below) Label Operation Operand Address Machine Code Comments read a read b set c = 0 if a == b set c = a - 7 + (2 * b - 3) else if a == 3 set c = a b + 2 write c
Write program segments that perform the operation C C+ A x B using each of the instruction classes indicated in Exercise 1 above. Assume that A, B, and C are memory 3. addresses. lleuing data Lin the