Chapter

Chapter 10: Hashing

Dheeraj Malhotra and Neha Malhotra

Published by

Mercury Learning and Information

View more publications by Mercury Learning and Information

Search

Data Structures and Program Design Using Java

This chapter is in the book Data Structures and Program Design Using Java

© 2020 Walter de Gruyter GmbH, Berlin/Boston

You are currently not able to access this content.

© 2020 Walter de Gruyter GmbH, Berlin/Boston

You are currently not able to access this content.

Chapters in this book

Frontmatter i
Contents vii
Preface xiii
Acknowledgments xv
Chapter 1: Introduction to Data Structures 1
Chapter 2: Introduction to the Java Language 21
Chapter 3: Arrays 61
Chapter 4: Linked Lists 103
Chapter 5: Queues 163
Chapter 6: Searching and Sorting 201
Chapter 7: Stacks 241
Chapter 8: Trees 283
Chapter 9: Multi-Way Search Trees 339
Chapter 10: Hashing 353
Chapter 11: Files 381
Chapter 12: Graphs 393
Appendix: Answers to Multiple Choice Questions 425
Index 427

https://doi.org/10.1515/9781683924623-012

Chapters in this book

Frontmatter i
Contents vii
Preface xiii
Acknowledgments xv
Chapter 1: Introduction to Data Structures 1
Chapter 2: Introduction to the Java Language 21
Chapter 3: Arrays 61
Chapter 4: Linked Lists 103
Chapter 5: Queues 163
Chapter 6: Searching and Sorting 201
Chapter 7: Stacks 241
Chapter 8: Trees 283
Chapter 9: Multi-Way Search Trees 339
Chapter 10: Hashing 353
Chapter 11: Files 381
Chapter 12: Graphs 393
Appendix: Answers to Multiple Choice Questions 425
Index 427

Institutional Access

How does access work?

Downloaded on 26.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9781683924623-012/html