Database Management System Question
Database Management System Question With Answer & Solution
Que. - In B+ tree the node which points to another node is called
Que. - 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 :
Que. - A technique for direct search is
Que. - 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.
Que. - Key value pairs is usually seen in
Que. - What is the best definition of a collision in a hash table?
Que. - Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?
Que. - Breadth First Search is used in
Que. - A(n) can be used to preserve the integrity of a document or a message.
Que. - The property (or set of properties) that uniquely defines each row in a table is called the:
Showing
631
To
640 of 1293 results