All the update methods in the Java collection framework are synchronized. false

Question

All the update methods in the Java collection framework are synchronized. false true You can use index to traverse elements in a set. false true the elements in KashSet are ordered. false true the union, difference, and intersection apply to set as well as list, because the methods addAll, removeAll, and retain All are defined in the Collection interface. true false the classes HastSet, LinkedHashSet, TreeSet, ArrayList, Vector, Stack, LinkedList, HashMap, LinkedHashMap, and TreeMap are cloneable and serializable. false true The worst-time complexity for quick sort is 0(n*n) 0(nlogn) 0(logn) 0(n) 0(1) The average-time complexity for quick sort is 0(nlogn) 0(logn) 0(1) 0(n) 0(n*n) The algorithm does not compare keys. quick sort merge sort heap sort radix sort

Explanation / Answer

Question 1)- Answer is option A ie false

                                    HashSet, ArrayList are not synchronized

Question 2)- Answer is option A is false

                                  Because Set not contain any duplicate element.

Question3)- Answer is option A ie false

Because Hashing is not performed in ordered way.

Question 4)- Answer is option A ie true

Question 5)- Answer is option B ie -true

Question 6)- Answer is option A ie O(n*n).

                                     O(n*n) when the input array is already in shorted order

Question 7)-Option A is correct ie O (nlogn).

Question 8)- Option D is correct ie radix sort.

Because this algorithm perform the sorting based upon array of alphabet or decimal number position in the input array.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---