What is difference between hash mapping and hash table?
Answer Posted / khalid
Both provide key-value access to data. The Hashtable is one
of the original collection classes in Java. HashMap is part
of the new Collections Framework, added with Java 2, v1.2.
The key difference between the two is that access to the
Hashtable is synchronized on the table while access to the
HashMap isn't. You can add it, but it isn't there by
default.
Another difference is that iterator in the HashMap is fail-
safe while the enumerator for the Hashtable isn't. If you
change the map while iterating, you'll know.
And, a third difference is that HashMap permits null values
in it, while Hashtable doesn't.
For new code, I would tend to always use HashMap.
Is This Answer Correct ? | 0 Yes | 5 No |
Post New Answer View All Answers
What is difference between printf and scanf?
Is java pass by value or pass by reference?
What are the main uses of the super keyword?
How is garbage collection controlled?
Can we declare a constructor as final?
What are the differences between this and super keyword?
What is protected in java?
How big is a boolean?
what is the purpose of using rmisecuritymanager in rmi?
What method is used to specify a container's layout in java programming?
What is the meaning of I ++ in java?
What is an image buffer?
Does anyone still use java?
What is the difference between the boolean & operator and the && operator in java programming?
What is the difference between static method and instance method in Java?