Introducing Data Structures with Java > Array Data Structures > 5.10 POINTERS/REFERENCES

Table of Contents

Download Safari Books Online apps: Apple iOS | Android

Entire Site

Free Trial

Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.

This Book

Introducing Data Structures with Java

Search

Dedication

About the Author

Preface

Ch. 1. Some Basic Ideas

Ch. 2. Data Types

Ch. 3. Using Java

Ch. 4. File Input and Output

Ch. 5. Array Data Structures

5.1 INTRODUCTION

5.2 WHAT IS AN ARRAY?

5.3 A SIMPLE ARRAY APPLICATION

5.4 ARRAYS OF OTHER DATA

5.5 MULTIDIMENSIONED ARRAYS

5.6 POPULATING THE ARRAY—NESTED LOOPS

5.7 ACCESSING AN ARRAY COLUMN BY COLUMN

5.8 FURTHER USES FOR THE APPLICATION

5.9 DYNAMICALLY DECLARING ARRAYS

5.10 POINTERS/REFERENCES

5.11 THE 'GARBAGE' PROBLEM

5.12 SUMMARY

5.13 CODE LISTING

EXERCISES

Ch. 6. Searching Arrays

Ch. 7. Hashing and Hash Tables

Ch. 8. Sorting Arrays—Selection, Bubble, Insertion, Merge and Quick Sorts

Ch. 14. Case Study 1—A Student Grades Program

Ch. 15. Case Study 2—An Inventory Table

Ch. 16. Case Study 3—A Flight Departures Timetable

Ch. 17. Case Study 4—A Queue Simulation

Appx. A. Accompanying Programs

Appx. B. Solutions to Exercises

Index

5.10 POINTERS/REFERENCES

In all the previous examples, a variable is taken to be a location of appropriate size for an item of the data type in question.

A static declaration such as

You are currently reading a PREVIEW of this book.

Get instant access to over
$1 million worth of books and videos.

Start a Free Trial

Download Safari Books Online apps: Apple iOS | Android

This Book

Search

Contents

Chapter 5. Array Data Structures > 5.10 POINTERS/REFERENCES

5.10 POINTERS/REFERENCES