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
frosja888 [35]
3 years ago
11

Consider the following skeletal C program: void fun1(void); /* prototype */ void fun2(void); /* prototype */ void fun3(void); /*

prototype */ void main() { int a, b, c; . . . } void fun1(void) { int b, c, d; . . . } void fun2(void) { int c, d, e; . . . } void fun3(void) { int d, e, f; . . . } 256 Chapter 5 Names, Bindings, and Scopes Given the following calling sequences and assuming that dynamic scoping is used, what variables are visible during execution of the last function called? Include with each visible variable the name of the function in which it was defined. a. main calls fun1; fun1 calls fun2; fun2 calls fun3. b. main calls fun1; fun1 calls fun3. c. main calls fun2; fun2 calls fun3; fun3 calls fun1. d. main calls fun3; fun3 calls fun1. e. main calls fun1; fun1 calls fun3; fun3 calls fun2. f. main calls fun3; fun3 calls fun2; fun2 calls fun1
Computers and Technology
1 answer:
natita [175]3 years ago
8 0

Answer:

Check the explanation

Explanation:

a) main calls fun1; fun1 calls fun2; fun2 calls fun3

fun3()                                        d, e, f

fun2()                                        c, d, e

fun1()                                        b, c, d

main()                                        a, b,c

CALL STACK SHOWING THE VARIABLES OF EVERY FUNCTION

   From the above call stack diagram, it is very clear that the last function call is made to fun3().

   In fun3(), the local variables "d, e, f" of fun3() will be visible

   variable "c" of fun2() will be visible

   variable "b" of fun1() will be visible

   variable "a" of main() will be visible

b) main calls fun1; fun1 calls fun3

fun3()                                        d, e, f

fun1()                                        b, c, d

main()                                        a, b,c

CALL STACK SHOWING THE VARIABLES OF EVERY FUNCTION

   From the above call stack diagram, it is very clear that the last function call is made to fun3().

   In fun3(), the local variables "d, e, f" of fun3() will be visible

   variable "b, c" of fun1() will be visible

   variable "a" of main() will be visible

c) main calls fun2; fun2 calls fun3; fun3 calls fun1

fun1()                                        b, c, d

fun3()                                        d, e, f

fun2()                                        c, d, e

main()                                        a, b,c

CALL STACK SHOWING THE VARIABLES OF EVERY FUNCTION

   From the above call stack diagram, it is very clear that the last function call is made to fun1().

   In fun1(), the local variables "b, c, d" of fun1() will be visible

   variable "e, f" of fun3() will be visible

   variable "a" of main() will be visible

d) main calls fun1; fun1 calls fun3; fun3 calls fun2

fun2()                                        c, d, e

fun3()                                        d, e, f

fun1()                                        b, c, d,

main()                                        a, b,c

CALL STACK SHOWING THE VARIABLES OF EVERY FUNCTION

   From the above call stack diagram, it is very clear that the last function call is made to fun2().

   In fun2(), the local variables "c, d, e" of fun2() will be visible

   variable "f" of fun3() will be visible

     variable "b" of fun1() will be visible

   variable "a" of main() will be visible

The last function called will comprise of all its local variables and the variables other than its local variables from all its preceding function calls till the main function.

You might be interested in
A new object of type list is created for each recursive invocation of f.A. TrueB. False
sammy [17]

Answer:

True but double check!

7 0
3 years ago
A database is used instead of a spreadsheet when
guajiro [1.7K]
            Both spreadsheets and databases, play a part in the daily
    operations of many businesses. While you do not necessarily need to choose between spreadsheets and databases, they are often suited to different types of tasks. Understanding the key differences between spreadsheets and databases is vital if you want to make the best use of either or both of them.
     Spreadsheets and databases share some characteristics, but they involve different technologies.
               Databases generally involve a higher level of technical processing.
-Rosie
4 0
3 years ago
Dell Computer uses recycled and recyclable materials in its product and packaging design in an effort to minimize damage to the
RoseWind [281]

Answer:

sustainability

Explanation:

Sustainability -

It refers to the method to meet the needs of the present generation without hampering the needs of the future generation as well , is referred to as sustainability .

The process of sustainability require to follow the concept of reuse and recycle to be safe for the environment .

The process is very safe for the planet , as it environmental friendly .

Hence , from the given scenario of the question ,

The correct answer is sustainability .

6 0
3 years ago
Who invented the Graphical User Interface (GUI)?
Ludmilka [50]
The Graphical User Interface was invented by <span>Xerox PARC by </span>Alan Kay<span>, </span>Douglas Engelbart
5 0
3 years ago
A router receives a packet and determines the outbound link for the packet. When the packet arrives, 2/3 of one other packet is
vlada-n [284]

Answer:

Queuing Delay is 0.08 seconds

Explanation:

The answer follows a formula that is relatively easy to use and is detailed below.

Queuing Delay = [(L - x) + (nL)] / R

where,

L is packet length given as 3,000 bytes

x is the currently transmitted packet given as 2/3 * 3,000 = 2,000

n is the number of packets waiting in the Que given as 5

R is the rate of transmission given as 4 Mbps (4 * 10^6 Bps)

We can simply plug in the above information in the equation for computing Queuing Delay.

Lets take the numerator first which would be [(3000 - 2000) + (5 * 3000)]

The numerator would be 16000 bytes. These are being transmitted at 4Mbps. So, 16000*4*5 = 320,000 "bits"

Queuing Delay= 320,000/4000000

Queuing Delay = 0.08 seconds.

As we can see, the formula is quite intuitive to use. You are simply taking the number of packets to be transmitting, incorporating the partially transmitted packet, multiplying by the number of packets and the rate of transmission and then dividing the product by the rate of transmission to compute what the delay in the Que is.

6 0
3 years ago
Other questions:
  • WHAT IS SQL AND HOW CAN YOU MEET THE DATA REQUIREMENTS ALSO MAINTAINING DATA INTEGRITY,AND LASTLY STATE THE FULL MEANING OF SQL
    11·1 answer
  • The largest value (in hex) that can be loaded into Register A of HCS12 is (Points : 2) 0x8.
    9·1 answer
  • python A pet shop wants to give a discount to its clients if they buy one or more pets. The discount is equal to 20 percent of t
    12·1 answer
  • When network cards are communicating, bits can occasionally be corrupted in transmission?
    5·1 answer
  • BEING TIMED HELP ASAP
    12·2 answers
  • Name at least TWO kinds of gaming experiences that are possible with these new control devices but were not possible on original
    7·1 answer
  • Each web site contains a(n) ____ page, which is the first document users see when they access the site.
    9·1 answer
  • Write a brief description of what the local authorities are recommending in the news people should do to protect themselves from
    8·1 answer
  • What are the odds that you find someone you know in person on here
    5·1 answer
  • I need the full code for 6.1.3 code hs circles and squares please answer please help
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!