Please enable JavaScript.

Coggle requires JavaScript to display documents.

Mapa Mental 7 - Coggle Diagram

- - - - This function assigns an integer between 0 and m − 1, called the hash address, to
        a key.
  - - - Keys are stored in linked lists attached to cells of a hash table.
        Each list contains all the keys hashed to its cell.
      - Load factor
        
        The ratio α = n/m, plays a crucial role in the efficiency of hashing. In particular, the average number of pointers (chain links) inspected in successful searches, S, and unsuccessful searches, U, turns out to be
        
        S ≈ 1 + α/2 and U = α
    - - In closed hashing, all keys are stored in the hash table itself without the use
        of linked lists.
      - Linear Probing
        
        checks the cell following the one where the collision occurs. If that cell is empty, the new key is installed here; if the next cell is already occupied, the availability of that cell’s immediate successor is checked, and so on.
- - - - -
        
        The first considers only sets that are subsets of some large set U, called the universal SET
        
        If set U has n elements, then any subset S of U can be represented by a bit string of size n, called a bit vector, in which the ith element is 1 if and only if the ith element of U is included in set S
        
        The second and more common way to represent a set for computing purposes
        is to use the list structure to indicate the set’s elements.
    - - Set cannot contain identical elements;.
      - Set is an unordered collection of items; therefore,
        changing the order of its elements does not change the set.
      - A List can
      - A List, defined as an
        ordered collection of items, is exactly the opposite.