what is the difference between HashMap And HashTable?
Answer Posted / stalin
The HashMap class is roughly equivalent to Hashtable, except
that it is unsynchronized and permits nulls. (HashMap allows
null values as key and value whereas Hashtable doesnt
allow). HashMap does not guarantee that the order of the map
will remain constant over time. HashMap is unsynchronized
and Hashtable is synchronized
| Is This Answer Correct ? | 8 Yes | 0 No |
Post New Answer View All Answers
What is hash code collision?
What is the use of private static?
What is a method signature java?
How does the java compiler work?
Is vector thread safe in java?
What is an infinite loop?
How do you take thread dump in java?
Why are getters and setters used?
Why is a string immutable?
What is a local, member and a class variable?
What is a two-pass assembler?
What does java edition mean?
Write an algorithm program in java for the following question.. In a VLSI design techniques,they used rectangles to design circuits. EVery rectangle is to be placed according to x,y coordinates. Check whether or not two rectangles overlap each other. Here overlapping of rectangles is acceptable, if 1) one rectangle intersect with other. 2) one rectangle fully covers other. The time of algorithm should not exceed o(n logn).
Can you extend main method in java?
How will you invoke any external process in java?