单项选择题X 纠错
A.Compilation fails.
B.aAaA aAa AAaa AaA
C.AAaa AaA aAa aAaA
D.AaA AAaa aAaA aAa
E.aAa AaA aAaA AAaa
F.An exception is thrown at runtime.
你可能喜欢
单项选择题
A.Compilation fails.
B.An exception is thrown at runtime.
C.[608， 610， 612， 629] [608， 610]
D.[608， 610， 612， 629] [608， 610， 629]
E.[606， 608， 610， 612， 629] [608， 610]
F.[606， 608， 610， 612， 629] [608， 610， 629]
多项选择题
A.The class implements java.lang.Comparable.
B.The class implements java.util.Comparator.
C.The interface used to implement sorting allows this class to define only one sort sequence.
D.The interface used to implement sorting allows this class to define many different sort sequences.
多项选择题
A.public int hashCode（）
B.public void hashCode（）
C.public int compareTo（Object o）
D.public boolean equals（Object o）
E.public boolean compareTo（Key k）
单项选择题
A.return super.hashCode（）；
B.return name.hashCode（） + age * 7；
C.return name.hashCode（） + comment.hashCode（） / 2；
D.return name.hashCode（） + comment.hashCode（） / 2- age * 3；
单项选择题
A.The set variable contains all six elements from the coll collection， and the order is guaranteed to be preserved.
B.The set variable contains only three elements from the coll collection， and the order is guaranteed to be preserved.
C.The set variable contains all six elements from the coll collection， but the order is NOT guaranteed to be preserved.
D.The set variable contains only three elements from the coll collection， but the order is NOT guaranteed to be preserved.
单项选择题
A.Set set = new TreeSet（）；
B.Set set = new HashSet（）；
C.Set set = new SortedSet（）；
D.List set = new SortedList（）；
E.Set set = new LinkedHashSet（）；
单项选择题
A.A
B.B
C.C
D.D
单项选择题
A.Tea
B.Coffee
C.Coffee Tea
D.Compilation fails.
E.The code runs with no output.
F.An exception is thrown at runtime.
单项选择题
A.Compilation fails.
B.An exception is thrown at runtime.
C.[608， 610， 612， 629] [608， 610]
D.[608， 610， 612， 629] [608， 610， 629]
E.[606， 608， 610， 612， 629] [608， 610]
F.[606， 608， 610， 612， 629] [608， 610， 629]
单项选择题
A.The time to find the value from HashMap with a Person key depends on the size of the map.
B.Deleting a Person key from a HashMap will delete all map entries for all keys of type Person.
C.Inserting a second Person object into a HashSet will cause the first Person object to be removed as a duplicate.
D.The time to determine whether a Person object is contained in a HashSet is constant and does NOT depend on the size of the map.
