Publicado por Alphascript Publishing
ISBN 10: 6130227329 ISBN 13: 9786130227326
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 39,00
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In computer science, a hash table or hash map is a data structure that uses a hash function to efficiently map certain identifiers or keys (e.g., person names) to associated values (e.g., their telephone numbers). The hash function is used to transform the key into the index (the hash) of an array element (the slot or bucket) where the corresponding value is to be sought. Ideally the hash function should map each possible key to a different slot index, but this ideal is rarely achievable in practice (unless the hash keys are fixed; i.e. new entries are never added to the table after creation). Most hash table designs assume that hash collisions pairs of different keys with the same hash values are normal occurrences and must be accommodated in some way. 112 pp. Englisch.
Publicado por OmniScriptum, 2026
ISBN 10: 6130227329 ISBN 13: 9786130227326
Librería: preigu, Osnabrück, Alemania
EUR 125,30
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Hash Table | Computer science, Data structure, Hash function, Unique key, Value (mathematics), Array data type, Collision (computer science), Instruction (computer science), Amortized analysis, Search tree | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130227326 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.