Why is Dictionary preferred over Hashtable in C#?

Question

In most programming languages, dictionaries are preferred over hashtables. What are the reasons behind that?

Answer 1

People are saying that a Dictionary is the same as a hash table.

This is not necessarily true. A hash table is one way to implement a dictionary. A typical one at that, and it may be the default one in .NET in the Dictionary class, but it's not by definition the only one.

You could equally well implement a dictionary using a linked list or a search tree, it just wouldn't be as efficient (for some metric of efficient).