Answer Posted / eknath

To successfully store and retrieve objects from a hashtable,
the objects used
as keys must implement the hashCode method and the equals
method.

In a nutshell, since null isn't an object, you can't call
.equals() or .hashCode() on it, so the Hashtable can't
compute a hash to use it as a key.

HashMap is newer, and has more advanced capabilities, which
are basically just an improvement on the Hashtable
functionality. As such, when HashMap was created, it was
specifically designed to handle null values as keys and
handles them as a special case.

Specifically, the use of null as a key is handled like this
when issuing a .get(key):

(key==null ? k==null : key.equals(k))

What is hotjava?

1009

---

What are memory tables?

1096

---

Is upper case in java?

963

---

Can java arraylist hold different types?

1076

---

What are classloaders?

1021

---

What is a finally block? Is there a case when finally will not execute?

1080

---

What is bool mean?

1079

---

What data structures are used to perform recursion?

1054

---

What is the difference between the size and capacity of a vector?

1044

---

What do you mean Abstraction in java?

1088

---

What is volatile data type?

1012

---

What are void methods?

1024

---

Is hashset ordered?

1074

---

Why there are some null interface in JAVA? What does it mean? Give some null interface in JAVA?

1088

---

What is the differences between c++ and java? Explain

1051

---