If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

Related MCQs

• Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
• A                  is a pictorial depiction of the schema of a database that shows the relations in the database, their attributes, and primary keys and foreign keys.
• State true or false i) A candidate key is a minimal super key. ii) A candidate key can also refer to as surrogate key.
• What is the best definition of a collision in a hash table?
• Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
• Which join refers to join records from the write table that have no matching key in the left table are include in the result set:
• A hash function must meet ________ criteriA:)
• Which key is referencing a primary key in a table:
• A relation is said to be in 3 NF if (i) it is in 2 NF (ii) non-key attributes are independent of one another (iii) key attribute is not dependent on part of a composite key (iv) has no multi-valued dependency
• If a relationship has a cascade updates constraint, then if ________ in the parent table is changed, then the same change will automatically be made to any corresponding foreign key value.