Data Structures Demystified

Front Cover
McGraw Hill Professional, Mar 15, 2004 - Computers - 300 pages

Whether you are an entry-level or seasoned designer or programmer, learn all about data structures in this easy-to-understand, self-teaching guide that can be directly applied to any programming language. From memory and addresses to hashtables, authors Keogh and Davidson, provide clear explanations that demystify this “algebra of programming.”

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Chapter 1 Memory Abstract Data Types and Addresses
1
Chapter 2 The Point About Variables and Pointers
15
Chapter 3 What Is an Array?
33
Chapter 4 Stacks Using an Array
55
Chapter 5 Queues Using an Array
77
Chapter 6 What Is a Linked List?
93
Chapter 7 Stacks Using Linked Lists
113
Chapter 8 Queues Using Linked Lists
129
Insert Delete Peek Find
149
Chapter 10 What Is a Tree?
177
Chapter 11 What Is a Hashtable?
217
Final Exam
251
Answers to Quizzes and Final Exam
255
Index
271
Copyright

Other editions - View all

Common terms and phrases

About the author (2004)

JIM KEOGH (Ridgefield Park, NJ) is a Columbia University Faculty member and teaches Object-oriented programming along with other computer science courses.

KEN DAVIDSON (Yorktown Heights, NY) is a Columbia University faculty member who teaches Data Structures along with other computer science courses.

Bibliographic information