Edexcel International AS and A level Computer Science XCP01/YCP01 · 18.2.5
Methods to handle collisions in a hash table
- Code
- 18.2.5
- In
- 18.2 Methods to represent and handle ADTs
- Topic
- U4 Advanced Practical Programming and Problem-solving
- Course
- International AS and A level Computer Science XCP01/YCP01
- Board
- Edexcel
Codes and titles are read by a script from Edexcel's published specification and have not been checked by a person. What each point covers is in the specification itself: Edexcel’s specification.
Points under 18.2.5
Points in 18.2 Methods to represent and handle ADTs
- 18.2.1 Circular queues as fixed-length lists
- 18.2.2 Methods to represent and handle a linked list
- 18.2.3 Methods to represent and handle a hash table
- 18.2.4 Hash algorithm
- 18.2.5 Methods to handle collisions in a hash table
- 18.2.6 Methods to represent a graph
- 18.2.7 Methods to represent and handle a binary search tree
- 18.2.8 Recursive tree traversal algorithms