- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
Used Trade Paper
Ships in 1 to 3 days
Other titles in the Demystified series:
Data Structures Demystifiedby James Keogh
Synopses & Reviews
The fast and easy way to understanding the fundamentals of data structures
If youve been searching for that quick, easy-to-understand guide to walk you through data structures, look no further. Data Structures Demystified is all these things and more. Whether youre trying to program stacks and linked lists or figure out hashtables, here youll find step-by-step instruction to get the job done fast.
No longer will you have to wade through thick, dry academic tomes, heavy on technical language and information you dont need. In Data Structures Demystified, each chapter starts off with an example from everyday life to demonstrate upcoming concepts, making this a totally accessible read. The authors goes a step further and offer examples at the end of the chapter illustrating what youve just learned in Java and C++.
Simple enough for a beginner, but challenging enough for an advanced student, Data Structures Demystified is your shortcut to mastering data structures.
This one-of-a-kind self-teaching text offers:
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.”
Key Features and Benefits- Organized like a fun and painless self-teaching guide- Friendly, clear, non-intimidating writing style makes the content accessible- Quizzes at end of each chapter; Final exam at end of book- Written by experienced instructors- Great value--a lot of knowledge for twenty bucks
About the Author
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.
Table of Contents
1: Memory, Abstract Data Types, and Addresses
3: What Is an Array?
5: Queues Using an Array
7: Stacks Using Linked Lists
9: Stacks and Queues: Insert, Delete, Peek, Find
11: What Is a Hashtable?
B: Answers to Quizzes and Final Exam