Data structures demystified / James Keogh & Ken Davidson.
Material type:
Item type | Current library | Call number | Copy number | Status | Notes | Date due | Barcode |
---|---|---|---|---|---|---|---|
![]() |
Female Library | QA76.9 .D35 K46 2004 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000175490 | |
![]() |
Female Library | QA76.9 .D35 K46 2004 (Browse shelf (Opens below)) | 2 | Available | STACKS | 51952000175506 | |
![]() |
Main Library | QA 76.9 .D35 K46 2004 (Browse shelf (Opens below)) | 1 | Available | STACKS | 51952000157441 | |
![]() |
Main Library | QA 76.9 .D35 K46 2004 (Browse shelf (Opens below)) | 2 | Available | STACKS | 51952000157458 | |
![]() |
Main Library | QA 76.9 .D35 K46 2004 (Browse shelf (Opens below)) | 3 | Available | STACKS | 51952000157465 |
Includes quizzes and answers.
Includes index.
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 -- Answers to quizzes and final exam -- Index
If you've been searching for that quick, easy to understand quide to walk you through data structures, look no further. Whether you're trying to program stacks and linked lists or figure out hashtables, here you'll find step by step instructions to get the job done fast. Each chapter starts off with an example from everyday life to demonstrate upcoming concepts. The authors go a step further and offer examples at the end of the chapter illustrating what you've just learned in Java and C++.
1 2
There are no comments on this title.