Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | An array that is indexed by a hash function. All subsequent items with the same hash value as an existing one (a collision) are put in a single external list. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: SEPARATE CHAINING HASHING |
| Specialty definitions using "SEPARATE CHAINING HASHING": collision resolution scheme. (references) |
Hexadecimal (or equivalents, 770AD-1900s) (references)53 45 50 41 52 41 54 45 43 48 41 49 4E 49 4E 47 48 41 53 48 49 4E 47 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010011 01000101 01010000 01000001 01010010 01000001 01010100 01000101 00100000 01000011 01001000 01000001 01001001 01001110 01001001 01001110 01000111 00100000 01001000 01000001 01010011 01001000 01001001 01001110 01000111 |
HTML Code (1990) (references)S E P A R A T E   C H A I N I N G   H A S H I N G |
ISO 10646 (1991-1993) (references)0053 0045 0050 0041 0052 0041 0054 0045 0043 0048 0041 0049 004E 0049 004E 0047 0048 0041 0053 0048 0049 004E 0047 |
Encryption (beginner's substitution cypher): (references)533950355235543923742354348434841242355342434841 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
