Prev Next

Java / Map and its implementations

List the differences between HashTable and HashMap in Java collections.
HashMap. HashTable.
HashMap is not synchronized and therefore it is not thread safe. HashTable is internally synchronized and therefore it is thread safe.
HashMap allows maximum one null key and any number of null values.HashTable does not allow null keys and null values.
Iterators returned by the HashMap are fail-fast in nature.Enumeration returned by the HashTable are fail-safe in nature.
HashMap extends AbstractMap class.HashTable extends Dictionary class.
HashMap returns only iterator to traverse.HashTable returns both Iterator as well as Enumeration for traversal.
HashMap is fast.HashTable is slow.
HashMap is not a legacy class.HashTable is a legacy class.
HashMap is preferred in single threaded applications. If you want to use HashMap in multi threaded application, wrap it using Collections. synchronizedMap() method.Although HashTable is there to use in multi threaded applications, now a days it is not at all preferred. Because, ConcurrentHashMap is better option than HashTable.

More Related questions...

List the differences between HashTable and HashMap in Java collections. Similarities between HashMap and HashTable in Java. What is a resource bundle in Java? What is the Big-O notation for operations in a Hashmap? Is HashMap faster compared to ArrayList in terms of search? Difference between HashMap and ConcurrentHashMap. Is ConcurrentHashmap good for frequently updating concurrent data structure? What are the commonly used implementations of Map in Java? Difference between Collections.synchronizedMap(Map) and ConcurrentHashMap. Difference between Collections.synchronizedMap and Hashtable. Why is ConcurrentHashMap faster than Hashtable in Java? What are the different Reference types available in Java? Which methods you need to override to use an object as key in HashMap ? Why Map does not extend the Collection interface in Java Collections Framework? How Remove method works internally in Java HashMap? Explain NavigableMap in Java collection. Explain rehashing process in Java HashMap. How null key is handled in HashMap? What is the data-structure behind the Java HashMap implementation? Why are immutable objects in HashMap so effective? Why null is not allowed in ConcurrentHashmap? Does ConcurrentHashMap allow null keys and null values ? Difference between remove() and clear() methods in HashMap. Is hashcode method invoked internally when calling get and put method in Java? How hash collision is handled in HashMap? What are the interfaces that TreeMap implements? What interfaces that HashMap implements? Big O notation for TreeMap in Java. Is TreeMap synchronized in Java? Does TreeMap allow null key? Key object constraints on a TreeMap. Does IdentityHashMap use hashcode method? Does EnumMap allow null key? What design pattern that Collections.synchronizedMap implement? Difference between HashMap and IdentityHashMap. What is a ConcurrentSkipListMap? How do you sort a TreeMap by comparing its value? Default initial table size of ConcurrentHashMap. Does Map implement Iterable?
Show more question and Answers...

Set and its implementations

Comments & Discussions

Interviews Questions

About Javapedia.net

Javapedia.net is for Java and J2EE developers, technologist and college students who prepare of interview. Also this site includes many practical examples.

This site is developed using J2EE technologies by Steve Antony, a senior Developer/lead at one of the logistics based company.

Follow Javapedia updates

contact: javatutorials2016[at]gmail[dot]com

Kindly consider donating for maintaining this website. Thanks.

Copyright © 2026, javapedia.net, all rights reserved. · .

DMCA.com Protection Status