Flashcards
Computing A-Level Chapter 10
Cards in this deck (12)
- 1Hash Tablea data structure that stores key value pairs based on an index calculated from an algorithm
- 2Key/value pairthe key and it associated data
- 3Hashing algorithmcode that creates a unique index from given items of key data
- 4Cachea high-speed temporary area of memory
- 5Collisionwhen a hashing algorithm produces the same index for two or more different keys
- 6Clusteringwhen a hashing algorithm produces indices that are not randomly distributed
- 7Load Factorthe ratio of how many indices are available to how many there are in total
- 8Indexthe location where values will be stored, calculated from the key
- 9Chaininga technique for generating a unique index when there is a collision by adding the key/value to a list stored at the same index
- 10Rehashingthe process of running the hashing algorithm again when a collision occurs
- 11Dictionarya data structure that maps keys to data
- 12Associative Arraya two dimensional structure containing key/value pairs of data
Information
- Description
- A level Computing Flashcards on Computing A-Level Chapter 10, created by Sam Carvell on 18/05/2018.
- Created by
- Sam Carvell
- Views
- 0
- Rating