What are the differences between HashMap and HashTable in Java? – InterviewSolution

InterviewSolution

1.

What are the differences between HashMap and HashTable in Java?

Answer»

HashMap	HashTable
HashMap is not synchronized THEREBY making it better for non-threaded applications.	HashTable is synchronized and HENCE it is suitable for threaded applications.
Allows only ONE NULL key but any number of null in the values.	This does not allow null in both keys or values.
Supports order of insertion by making use of its SUBCLASS LinkedHashMap.	Order of insertion is not guaranteed in HashTable.

Discussion

No Comment Found

Related InterviewSolutions

How does the size of ArrayList grow dynamically? And also state how it is implemented internally.
How many overloaded add() and addAll() methods are available in the List interface? Describe the need and uses.
Why is the remove method faster in the linked list than in an array?
Why does the java array index start with 0?
Contiguous memory locations are usually used for storing actual values in an array but not in ArrayList. Explain.
Can you call a constructor of a class inside the another constructor?
Will the finally block get executed when the return statement is written at the end of try block and catch block as shown below?
Is it mandatory for a catch block to be followed after a try block?
How do exceptions affect the program if it doesn't handle them?
How does an exception propagate in the code?