CS61B Textbook Spring 2026
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
CS61B Textbook Spring 2026
  • Spring 2026 Textbook
  • Contributors
  • DISCLAIMER
  • 1. Introduction
  • 2. Defining and Using Classes
  • 3. References, Recursion, and Lists
  • 4. Testing
  • 5. SLLists
  • 6. DLLists and Arrays
  • 7. Resizing ArrayList
  • 8. Inheritance I: Interface and Implementation Inheritance
  • 9. Inheritance II: Subtype Polymorphism, Comparators, Comparables, Generic Functions
  • 10. Inheritance III: Iterators, Object Methods
  • 11. Asymptotics I
  • 12. Asymptotics II
  • 13. Asymptotics III
  • 14. Disjoint Sets
  • 15. Binary Search Trees
  • 16. B-Trees
  • 17. Red Black Trees
  • 18. Heaps and Priority Queues
  • 19. Tree Traversals and Graphs
  • 20. Graph Traversals and Implementations
  • 21. Shortest Paths
  • 22. Minimum Spanning Trees
  • 23. Reductions and Decomposition
  • 24. Hashing I
    • 24.1 Introduction to Hashing: Data Indexed Arrays
    • 24.2 Hash Code
    • 24.3 "Valid" & "Good" Hashcodes
    • 24.4 Handling Collisions: Linear Probing and External Chaining
    • 24.5 Resizing & Hash Table Performance
    • 24.6 Summary
    • 24.7 Exercises
  • 25. Hashing II
  • 26. Prefix Operations and Tries
  • 27. Software Engineering I
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

24. Hashing I

By William Lee and Angel Aldaco

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

Last updated 6 days ago