| << Chapter < Page | Chapter >> Page > |
True.
False. While implementation of the Set interface may have some minor impact on the searching speed of a TreeSet object, the primary reason for the fast searching speed is the fact that theimplementation uses a tree structure.
True. A TreeSet object will perform the search very rapidly with a time cost of only log(n) where n is the number of elements. On the other hand,for the same number of elements, because of a different underlying data structure, a search on an ArrayList object will probably require more time than a search on a TreeSet object. As the number of elements increases, thedifference in time cost between the two will also increase.
False. The Collection interface does not declare a method named get . Rather, the get method is added to the List interface to define a more specialized form of collection.
False. While an ArrayList object may contain duplicate values, the ArrayList object in Listing 1 was populated with the values contained in the TreeSet object, which does not allow duplicate values. Therefore, in this case, the ArrayList object may not contain duplicate values.
False. The code in Listing 1 instantiates an ArrayList object and populates it with the contents of the existing TreeSet object. As a result, we then have two different Collection objects of different actual types containing the same elements.
True.
True.
False. The program shown in Listing 1 instantiates a TreeSet object and populates it with approximately 2,000,000 elements.
True.
False. The manner in which the search will be performed will probably differ from one concrete implementation of the interface to the next. For example, a TreeSet object will perform the search very rapidly with a time cost of only log(n) where n is the number of elements. On the other hand, for the same numberof elements, because of a different underlying data structure, a search on an ArrayList object will probably require more time than a search on a TreeSet object. As the number of elements increases, the difference in time cost between the two will also increase.
True.
False.
The contract for the contains method requires that the method:
True.
False. Iterator is not one of the concrete implementations.
True.
True.
True.
This section contains a variety of miscellaneous information.
Financial : Although the Connexions site makes it possible for you to download aPDF file for this module at no charge, and also makes it possible for you to purchase a pre-printed version of the PDF file, youshould be aware that some of the HTML elements in this module may not translate well into PDF.
I also want you to know that, I receive no financial compensation from the Connexions website even if you purchase the PDF version ofthe module.
In the past, unknown individuals have copied my modules from cnx.org, converted them to Kindle books, and placed them for sale onAmazon.com showing me as the author. I neither receive compensation for those sales nor do I know who does receive compensation. If youpurchase such a book, please be aware that it is a copy of a module that is freely available on cnx.org and that it was made andpublished without my prior knowledge.
Affiliation : I am a professor of Computer Information Technology at Austin Community College in Austin, TX.
-end-
Notification Switch
Would you like to follow the 'Object-oriented programming (oop) with java' conversation and receive update notifications?
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|