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
Can we able to pass objects as an arguments in java?
Explain the polymorphism principle?
What is parseint?
Explain static nested classes ?
What is package private scope in java?
How will you call an Applet using Java Script Function?
What is hashmap in java?
What is oop in java?
Define a package.
Is a char always 1 byte?
Can we sort hashmap in java?
Is java call by value?
What is use of valueof () in java?
What is sorting in java?
Where is the find and replace?