adplus-dvertising
frame-decoration

Question

While finding the correct location for saving key value pair, how many times the key is hashed?

a.

1

b.

2

c.

3

d.

unlimited till bucket is found

Posted under Java Programming

Answer: (b).2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. While finding the correct location for saving key value pair, how many times the key is hashed?

Similar Questions

Discover Related MCQs

Q. Is hashmap an ordered collection.

Q. If two threads access the same hashmap at the same time, what would happen?

Q. How to externally synchronize hashmap?

Q. If large number of items are stored in hash bucket, what happens to the internal structure?

Q. How can we remove an object from ArrayList?

Q. How to remove duplicates from List?

Q. How to sort elements of ArrayList?

Q. When two threads access the same ArrayList object what is the outcome of the program?

Q. How is Arrays.asList() different than the standard way of initialising List?

Q. What is the difference between length() and size() of ArrayList?

Q. Which class provides thread safe implementation of List?

Q. Which of the below is not an implementation of List interface?

Q. What is the worst case complexity of accessing an element in ArrayList?

Q. When an array is passed to a method, will the content of the array undergo changes with the actions carried within the function?

Q. What is the default clone of HashSet?

Q. Do we have get(Object o) method in HashSet.

Q. What does Collections.emptySet() return?

Q. What are the initial capacity and load factor of HashSet?

Q. What is the relation between hashset and hashmap?

Q. Set has contains(Object o) method.