Flashcards
CS Paper 1 - Non AdvInfo
Cards in this deck (4)
- 1Hash tablesAn ADS that uses static data structures (arrays) to store data at specific indexes.
-Hash function is applied to the data, creating a key, this is where the data is stored.
When searching for a value, the hash function can be used to find it, so no need for time consuming algorithms - 2Open HashingValue is stored in the next available space. Can cause even more collisions as other values location could now also be taken. The table then might require rehashing if there is no available space. Typically the table needs to be 30% larger to store all the data this way, resulting in wasted space
- 3Closed HashingA linked list is used at each address where 2 or more values have the same location. Can be slower to read but no need for rehashing.
- 4—
Information
- Description
- Flashcards on CS Paper 1 - Non AdvInfo, created by James John on 23/05/2022.
- Created by
- James John
- Views
- 0
- Rating
More on Hash Tables and Dictionaries