CS61B Textbook Fall 2025
search
Ctrlk
GitBook Assistant
GitBook Assistant
Working...Thinking...
GitBook Assistant
Good afternoon

I'm here to help you with the docs.

Ctrli
AI Based on your contextquestion-circle
  • Fall 2025 Textbook
  • Contributors
  • DISCLAIMER
  • 1. Introductionchevron-right
  • 2. Defining and Using Classes
  • 3. References, Recursion, and Lists
  • 4. SLLists
  • 5. DLLists
  • 6. Arrays
  • 7. Testing
  • 8. ArrayList
  • 9. Inheritance I: Interface and Implementation Inheritancechevron-right
  • 10. Inheritance II: Subtype Polymorphism, Comparators, Comparables, Generic Functionschevron-right
  • 11. There is no chapter 11.
  • 12. Inheritance III: Iterators, Object Methodschevron-right
  • 13. Asymptotics Ichevron-right
  • 14. Disjoint Setschevron-right
  • 15. Asymptotics IIchevron-right
  • 16. ADTs and BSTschevron-right
  • 17. Asymptotics IIIchevron-right
  • 18. B-Treeschevron-right
  • 19. Red Black Treeschevron-right
  • 20. Hashing Ichevron-right
    • 20.1 Introduction to Hashing: Data Indexed Arrayschevron-right
    • 20.2 Hash Code
    • 20.3 "Valid" & "Good" Hashcodes
    • 20.4 Handling Collisions: Linear Probing and External Chaining
    • 20.5 Resizing & Hash Table Performance
    • 20.6 Summary
    • 20.7 Exercises
  • 21. Hashing IIchevron-right
  • 22. Heaps and Priority Queueschevron-right
  • 23. Tree Traversals and Graphschevron-right
  • 24. Graph Traversals and Implementationschevron-right
  • 25. Shortest Pathschevron-right
  • 26. Minimum Spanning Treeschevron-right
  • 27. Prefix Operations and Trieschevron-right
  • 28. Software Engineering Ichevron-right
  • 29. Reductions and Decompositionchevron-right
  • 30. Basic Sortschevron-right
  • 31. Quicksortchevron-right
  • 32. Software Engineering IIchevron-right
  • 33. More Quick Sort, Sorting Summarychevron-right
  • 34. Software Engineering IIIchevron-right
  • 35. Sorting and Algorithmic Boundschevron-right
  • 36. Radix Sortschevron-right
  • 37. Sorting and Data Structures Conclusionchevron-right
  • 38. Software Engineering IVchevron-right
  • 39. Compression and Complexitychevron-right
  • 40. Compression, Complexity, P = NPchevron-right
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

20. Hashing I

By William Lee and Angel Aldaco

20.1 Introduction to Hashing: Data Indexed Arrayschevron-right20.2 Hash Codechevron-right20.3 "Valid" & "Good" Hashcodeschevron-right20.4 Handling Collisions: Linear Probing and External Chainingchevron-right20.5 Resizing & Hash Table Performancechevron-right20.6 Summarychevron-right20.7 Exerciseschevron-right
Previous19.6 Exerciseschevron-leftNext20.1 Introduction to Hashing: Data Indexed Arrayschevron-right

Last updated 3 months ago