How is java hashmap implemented?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Core Java Interview Questions

What is the use of default method in interface in java? Explain

0 Answers  


What is intern method in java?

0 Answers  


Matrix multiplication only using OOP concepts .

0 Answers  


Are true and false keywords?

0 Answers  


How hashset works internally in java?

0 Answers  






What is the symbol for space?

0 Answers  


How many threads does a core java have?

0 Answers  


What is an class?

0 Answers  


Difference between linkedlist and arraylist.

0 Answers  


Keywords in Exceptions?

2 Answers  


public class AboutStrings{ public static void main(String args[]){ String s1="hello"; String s2="hel"; String s3="lo"; String s4=s2+s3; //to know the hash codes of s1,s4. System.out.println(s1.hashCode()); System.out.println(s4.hashCode()); // these two s1 and s4 are having same hashcodes. if(s1==s4){ System.out.println("s1 and s4 are same."); }else System.out.println("s1 and s4 are not same."); } } Somebody told me that, == operator compares references of the objects. In the above example even though s1 and s4 are refering to same object(having same hash codes), it is printing s1 and s4 are not same. Can anybody explain in detail why it is behaving like this? Thanks in Advance RavuriVinod

4 Answers   TCS,


How do I run java on windows?

0 Answers  


Categories