February 2014
Beginner
1248 pages
62h 25m
English
• Stacks (p. 209) are known as last-in, first-out (LIFO) data structures—the last item pushed (inserted) onto the stack is the first item popped (removed) from the stack.
• A called method must know how to return to its caller, so the return address of the calling method is pushed onto the method-call stack when the method is called. If a series of method calls occurs, the successive return addresses are pushed onto the stack in last-in, first-out order so that the last method to execute will be the first to return to its caller.
• The method-call stack (p. 210) contains the memory for the local variables used in each invocation of a method during a program’s execution. This data is known as the ...
Read now
Unlock full access