what is the difference between Dictionary and Hashtable ?

Question

.

Rajeesh Menoth · Accepted Answer

Hi,   Dictionary: It returns error if we try to find a key which does not exist. It is faster than a Hashtable because there is no boxing and unboxing. Only public static members are thread safe. Dictionary is a generic type which means we can use it with any data type. Hashtable: It returns null if we try to find a key which does not exist. It is slower than dictionary because it requires boxing and unboxing. All the members in a Hashtable are thread safe. Hashtable is not a generic type. Reference :   https://www.codeproject.com/Tips/602537/Hashtable-vs-Dictionary   http://www.c-sharpcorner.com/blogs/differences-between-hashtable-and-dictionary1