Data Structures Demystified (Demystified)
| | ||||||||||
| Data Structures Demystified | |
| by Jim Keogh and Ken Davidson | ISBN:0072253592 |
| McGraw-Hill/Osborne © 2004 | |
| 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. | |
| Table of Contents | |||
| Data Structures Demystified | |||
| Introduction | |||
| Chapter 1 | - | Memory, Abstract Data Types, and Addresses | |
| Chapter 2 | - | The Point About Variables and Pointers | |
| Chapter 3 | - | What Is an Array? | |
| Chapter 4 | - | Stacks Using an Array | |
| Chapter 5 | - | Queues Using an Array | |
| Chapter 6 | - | What Is a Linked List? | |
| Chapter 7 | - | Stacks Using Linked Lists | |
| Chapter 8 | - | Queues Using Linked Lists | |
| Chapter 9 | - | Stacks and Queues: Insert, Delete, Peek, Find | |
| Chapter 10 | - | What Is a Tree? | |
| Chapter 11 | - | What Is a Hashtable? | |
| Final Exam | |||
| Index | |||
| List of Figures | |||
| List of Tables | |||
Категории