Using division method, in a given hash table of size 157, the key of value 172 be placed at position

Related MCQs

• What is the table size when the value of p is 7 in multiplication method of creating hash functions?
• What is the hash function used in the division method?
• How many steps are involved in creating a hash function using a multiplication method?
• What is the hash function used in multiplication method?
• Uniform distribution of the hash address throughout the given set L is __________.
• What can be the value of m in the division method?
• Which hash function satisfies the condition of simple uniform hashing?
• What is the average retrieval time when n keys hash to the same slot?
• The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?