A Practical Guide to Data Structures and Algorithms using Java
eBook - PDF

A Practical Guide to Data Structures and Algorithms using Java

  1. 1,056 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

A Practical Guide to Data Structures and Algorithms using Java

Book details
Table of contents
Citations

About This Book

Although traditional texts present isolated algorithms and data structures, they do not provide a unifying structure and offer little guidance on how to appropriately select among them. Furthermore, these texts furnish little, if any, source code and leave many of the more difficult aspects of the implementation as exercises. A fresh alternative to

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access A Practical Guide to Data Structures and Algorithms using Java by Sally. A Goldman, Kenneth. J Goldman in PDF and/or ePUB format, as well as other popular books in Computer Science & Programming Games. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Chapman and Hall/CRC
Year
2007
ISBN
9781420010336
Edition
1
Topic
Computer Science
Subtopic
Programming Games
Index
Computer Science

Table of contents

  1. Front cover
  2. Contents
  3. Preface
  4. Acknowledgments
  5. Authors
  6. Part I. INTRODUCTION
  7. Chapter 1. Design Principles
  8. Chapter 2. Selecting an Abstract Data Type
  9. Chapter 3. How to Use This Book
  10. Part II. COLLECTION DATASTRUCTURES ANDALGORITHMS
  11. Chapter 4. Part II Organization
  12. Chapter 5. Foundations
  13. Chapter 6 .Partition ADT and the Union-Find Data Structure
  14. Chapter 7. Collection of Elements
  15. Chapter 8. Abstract Collection
  16. Chapter 9. Positional Collection ADT
  17. Chapter 10. Abstract Positional Collection
  18. Chapter 11. Array Data Structure
  19. Chapter 12. Circular Array Data Structure
  20. Chapter 13. Dynamic Array and Dynamic Circular Array Data Structures
  21. Chapter 14. Tracked Array Data Structure
  22. Chapter 15. Singly Linked List Data Structure
  23. Chapter 16. Doubly Linked List Data Structure
  24. Chapter 17. Buffer ADT and Its Implementation
  25. Chapter 18. Queue ADT and Implementation
  26. Chapter 19. Stack ADT and Implementation
  27. Chapter 20. Set ADT
  28. Chapter 21. Direct Addressing Data Structure
  29. Chapter 22. Open Addressing Data Structure
  30. Chapter 23. Separate Chaining Data Structure
  31. Chapter 24. Priority Queue ADT
  32. Chapter 25. Binary Heap Data Structure
  33. Chapter 26. Leftist Heap Data Structure
  34. Chapter 27. Pairing Heap Data Structure
  35. Chapter 28. Fibonacci Heap Data Structure
  36. Chapter 29. Ordered Collection ADT
  37. Chapter 30. Sorted Array Data Structure
  38. Chapter 31. Abstract Search Tree Class
  39. Chapter 32. Binary Search Tree Data Structure
  40. Chapter 33. Balanced Binary Search Trees
  41. Chapter 34. Red-Black Tree Data Structure
  42. Chapter 35. Splay Tree Data Structure
  43. Chapter 36. B-Tree Data Structure
  44. Chapter 37. B+-Tree Data Structure
  45. Chapter 38. Skip List Data Structure
  46. Chapter 39. Digitized Ordered Collection ADT
  47. Chapter 40. Trie Node Types
  48. Chapter 41. Trie Data Structure
  49. Chapter 42. Compact Trie Data Structure
  50. Chapter 43. Compressed Trie Data Structure
  51. Chapter 44. Patricia Trie Data Structure
  52. Chapter 45. Ternary Search Trie Data Structure
  53. Chapter 46. Spatial Collection ADT
  54. Chapter 47. KD-Tree Data Structure
  55. Chapter 48. Quad Tree Data Structure
  56. Chapter 49. Tagged Collection ADTs
  57. Chapter 50. Tagged Bucket Collection ADTs
  58. Part III. GRAPH DATA STRUCTURES AND ALGORITHMS
  59. Chapter 51. Part III Organization
  60. Chapter 52. Graph ADT
  61. Chapter 53. Abstract Graph and Graph Algorithms
  62. Chapter 54. Adjacency Matrix Data Structure
  63. Chapter 55. Adjacency List Data Structure
  64. Chapter 56. Weighted Graph ADT
  65. Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms
  66. Part IV. APPENDICES
  67. Appendix A
  68. Appendix B
  69. Appendix C
  70. Index
  71. Back cover