1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
grin007 [14]
3 years ago
6

Show the stack with all activation record instances, including static and dynamic chains, when execution reaches position 1 in t

he following skeletal program. Assume bigsub is at level 1.
function bigsub() {

function a() {

function b() {

... <----------------------------1

} // end of b

function c() {

...

b();

...

} // end of c

...

c();

} // end of a

...

a();

...

}// end of bigsum
Computers and Technology
1 answer:
astraxan [27]3 years ago
6 0

Answer:

Activation Records

The storage (for formals, local variables, function results etc.) needed for execution of a

subprogram is organized as an activation record.

An Activation Record for “Simple” Subprograms

.

Activation Record for a Language with Stack-Dynamic Local Variables

Dynamic link: points to the top of an activation record of the caller

Explanation:

You might be interested in
What is Gpu in simple terms ​
Bingel [31]
Graphic processing unit !!?????!!??!??!?!!?!!?
5 0
3 years ago
Read 2 more answers
WILL GIVE BRAINLIEST TO HELPFUL ANSWERS!
sashaice [31]

Algorithm is part of computer science. You an learn it on Khan academy. (you probably werent looking for this but no one was answering)

7 0
3 years ago
Jacob would like to include an arrow in his newsletter to point to some important information. He should _____.
qwelly [4]

Some people either add a shape as I do. But for this particular question it would be, either add word art or create a list with bullets. I would rather do word art or insert shape because that means you do not have to get the single bullet.


I really do hope this helped you. I hope you have a great day. And if I am incorrect I apologize.

3 0
3 years ago
Read 2 more answers
True or Flase<br><br> In C++, the body of a for loop may never run even once.
stiks02 [169]

Answer: True

Explanation: For loop is used in the C++ programming is defined as the statement that defines about the flow control .This loop works under some condition that is considered.

For loop is evaluated to execute for one time if the statement condition is true but there are also chances of no execution at all because of the incorrect condition. So, for loop might not run even once in that condition.Thus , the statement given is true.

3 0
3 years ago
A personal academic plan is a set of goals relating to the things you want to accomplish while you are in school.
Alex787 [66]

Answer:

True

Explanation:

8 0
2 years ago
Other questions:
  • The North American Free Trade Agreement (NAFTA) among Canada, Mexico, and the United States is intended to _____.
    5·2 answers
  • Which of the following should be the first page of a report?
    11·1 answer
  • zeroIt is a function that takes one argument and returns no value. The function stores the value 0 back into the parameter. x is
    8·1 answer
  • In this part, you have to implement a linked list that maintains a list of integers in sorted order. Thus, if the list contains
    13·1 answer
  • The number of bits per pixel is called what
    7·1 answer
  • Your computer is configured to obtain an ipv4 address and dns server address automatically. what utility will help you to find t
    12·1 answer
  • The correct ordering of the seven layers from "top" to "bottom" is
    11·1 answer
  • Which of the following should you consider when
    5·1 answer
  • I still haven't figured out how to award someone branliest will someone help me? If you explain to me how to do it i will do awa
    14·1 answer
  • The residual volume can be measured directly with: Select an answer and submit. For keyboard navigation, use the up/down arrow k
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!