Q-6: A main program consists of two procedures begins at memory address 7000H. Procedure-1 begins at begins at 6000H and Procedure-2 begins at 8000H respectively. Procedure-1 is called within Procedure-2 at memory address 8050H. In the main program Procedure-1 is called at 7040H and Procedure-2 is called twice: first at 7060H and then at 70AOH. Please note that Stack is used to save return addresses at the instants of procedure calls. Show the state of Stack while the program runs.

Q-6: A main program consists of two procedures begins at memory address 7000H. Procedure-1 begins at begins at 6000H and Procedure-2 begins at 8000H respectively. Procedure-1 is called within Procedure-2 at memory address 8050H. In the main program Procedure-1 is called at 7040H and Procedure-2 is called twice: first at 7060H and then at 70AOH. Please note that Stack is used to save return addresses at the instants of procedure calls. Show the state of Stack while the program runs.

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

Related questions

Q: 10) When the subroutine is called_ A) PC is pulled from the stack B) SP is incremented by 2…

A: 10) SP is incremented by 2 The decision instruction is of 2 words, the primary word is that the…

Q: 1. A company wants to evaluate employee records in order to lay off some workers on the basis of…

A: Here is the java program of the above problem. See below steps.

Q: What if a stack resource cannot be created

A: Answer the above question are as follows

Q: program C A certain main() program with one local variable number calls a function int…

A: It is defined as a powerful general-purpose programming language. It can be used to develop software…

Q: Refer to image to answer this; Show the current state of the runtime stack at the call pointed to…

A: Given, Show the current state of the runtime stack at the call pointed to below –include static and…

Q: Create a code that stores values on the stack in each iteration of the factorial label. How many…

A: Define a recursive function factorial(n).Check if n is less than or equal to 1:If true, return 1.…

Q: Consider the following statements: stackType stack; int x;

A: Given :

Q: StackGuard is a tool for detecting buffer overflows. It modifies the compiler to place a known…

A: Solution: Question 1. How effective is this approach at stopping stack-based buffer overflows?2.…

Q: Create, compile, and run a program that manages a stack. Specifically, your program sh new…

A: class Stack { // specifies maximum size of the stack or the number of boxes that can be present…

Q: . For the code below, draw a picture of the program stack when the function partition() is…

A: The first function named as partition will find the pivot element This is the main line in this…

Q: 4. How many instructions were executed to compute the factorial of 10? 5. What is the smallest…

A: Note: As per our guidelines, we are asked to answer first question of multiple questions. Please…

Q: Assume that the stack grows towards zero, the stack pointer is R6 and contains x4000. What are the…

A: In a computer system, the stack is a data structure used for managing program execution and storing…

Q: The following function is written incorrectly: int factorial (int n) { if (n == 0) return 1; return…

A: To find the result of calling a given function with large integer.

Q: What does this code accomplish? lw $4,0($sp) lw $3,4($sp)0 addi $sp,$sp,8 a push the contents…

A: What lw instruction does is, lw $destination register's address, offset($source register's address).…

Q: EBP must point to the return address at the end of a procedure, but ESP can point to whatever…

A: This Question is from assembly language in Computer Science. We discuss the answer with Proper…

Q: stack.h is in picture this is stack.c #include #include #include #include #include "stack.h"…

A: The C code is given below with output screenshot

Q: Postfix using Stacks The rules to convert an infix expression into an equivalent postfix expression…

A: The, code has given below:

Q: main() uses t0, t1, s0, s1, B() uses t4, s3, s4, C() uses t1, t2, t3, t4, s0, s5. How many words on…

A: Hey there, I am writing the required solution based on the above given question. Please do find the…

Q: 62. For the base and offset addresses in problem 61, how many words of data are cur- rently held in…

A: The question 61 is solved by me itself and the solution for 62 is below.

Concept explainers

Fundamentals of Input and Output Performance

The I/O subsystem is a component of computer system design that uses buses to assist communication between the Central Processing Unit, Computer Memory/Storage, and Input and Output Devices (that is known as peripheral devices). The I/O subsystem includes disc controllers, tape drives, discs, system buses, and other devices. The I/O database application reads and writes drives using the operating system windows I/O.

Question

100%

Q-6: A main program consists of two
procedures begins at memory
address 7000H. Procedure-1 begins
at begins at 6000H and Procedure-2
begins at 8000H respectively.
Procedure-1 is called within
Procedure-2 at memory address
8050H. In the main program
Procedure-1 is called at 7040H and
Procedure-2 is called twice: first at
7060H and then at 70AOH. Please
note that Stack is used to save return
addresses at the instants of
procedure calls. Show the state of
Stack while the program runs.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: State of Stack

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Input and Output Performance

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

How would you design a function to sort a stack, given that you can only use a temporary stack as additional data storage?
.ORIG x3000 ; Set up the user stack: LD R6, STKBASE ; Sets up the stack by loading the base address into R6 ; Prompt for the first string: LEA R0, PRMPT1 ; Loads the address of PRMPT1 into R0 PUTS ; Call GETS to get first string: LEA R0, STRNG1 ; Loads the address of STRNG1 ADD R6, R6, #-1 ; Push the address to store the string at STR R0, R6, #0 JSR GETSP ; Call GETSP ADD R6, R6, #2 ; Clean up (pop parameter & return value) ; Prompt for second string: LEA R0, PRMPT2 ; Loads the address of PRMPT2 PUTS ; Call GETS to get second string: LEA R0, STRNG2 ; Loads the address of STRNG2 ADD R6, R6, #-1 ; Push the second address to store the string at STR R0, R6, #0 JSR GETSP ; Call GETSP ADD R6, R6, #2 ; Clean up (pop parameter & return value) ; Output both strings: LEA R0, OUT1 ; First string... PUTS LEA R0, STRNG1 PUTSP LD R0, LF ; Print a linefeed OUT ; Write character to console (TRAP x21) LEA R0, OUT2 ;…
Nesting procedure calls how many return addresses will be on the stack by the time Sub3 is called? main PROC call Subl exit main ENDP Subl PROC call Sub2 ret Subl ENDP Sub2 PROC call Sub3 ret Rectangu Sub2 ENDP Sub3 PROC ret Sub3 ENDP 2 O1 3
Assembly programming
Computing And Software Systems
C++ In this project you will implement two small programs. One program will show an example of stack use and another program will show the use of a Queue 1. Use the STL to create your data structures 2. You should have the following features: a. Add a record b. Find a record c. Delete a record e. View all records
It is possible to demonstrate the return address of a function by using a series of instructions. Keep in mind that any modifications to the stack must not prohibit the process from returning control to the person who called it.
Q1: Write a C++ program to create two stacks using pointers, each stack contains 10 float values, then print out the average of each stack. 02: Write a C++ program to create a queue contains 20 integer values, then in the main
2. What is the address where the ascii string "!= " is stored? 3. What is the value of the stack pointer before the program executes?
It is possible to demonstrate the return address of a function by using a series of instructions. Keep in mind that any modifications to the stack must not prohibit the process from returning control to the person who called it.
1. A company wants to evaluate employee records in order to lay off some workers on the basis of service time (the most recently hired employees are laid off first). Only the employee ids are stored in stack. Write a program using stack and implement the following functions: Main program should ask the appropriate option from the user, until user selects an option for exiting the program. Enter_company (emp_id)- the accepted employee id(integer) is pushed into stack. Exit_company ()- The recently joined employee will be laid off from the company Show employee ()- display all the employees working in the company. count()- displays the number of employees working in the company. i) ii) iii) iv)
Please show Stack.h, Stack.cpp and main.cpp