1. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. C H A P T E R F I V E Memory Management

2. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-2 The Structure of Run-Time Memory Figure 5.1

3. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-3 Structure of a Called Method’s Stack Frame Figure 5.2

4. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-4 Example Program with Methods and Parameters Figure 5.3

5. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-5 Run-Time Stack with Stack Frames for Method Invocations Figure 5.4

6. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-6 Passing an Argument by Reference Example Figure 5.5

7. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-7 A Simple C-Style Linked List in the Heap Figure 5.6

8. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-8 Dynamic Memory Allocation for the One-Dimensional Array A Figure 5.7

9. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-9 Memory Allocation for Two-Dimensional Array C Figure 5.8

10. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-10 Sample Structure Representing an Individual Employee Figure 5.9

11. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-11 The New (5) Heap Allocation Function Call: Before and After Figure 5.10

12. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-12 Allocation of Stack and Heap Space for the Declaration of Array A Figure 5.11

13. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-13 Allocation of Stack and Heap Space for the Declaration of Point p Figure 5.12

14. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-14 Creating Widows and Orphans: A Simple Example Figure 5.13

15. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-15 Figure TA5.1

16. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-16 Node Structure and Example Heap for Reference Counting Figure 5.14

17. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-17 Node Structure and Example for Mark-Sweep Algorithm Figure 5.15

18. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-18 Heap after Pass I of Mark-Sweep Figure 5.16

19. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-19 Heap after Pass II of Mark-Sweep Figure 5.17

20. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-20 Initial Heap Organization for Copy Collection Figure 5.18

21. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-21 Result of a Copy Collection Activation Figure 5.19