A _________ is a nonlinear collection in which there is essentially no inherent
organization to the elements in the collection.
D. Stack
The implementation of the collection operations should not affect the way users
_____________ the collection.
A. implement
In the Java Collections API and throughout this text, __________ indicate both
the underlying data structure and the collection.
D. Stereotypes
The difference between a set and map is that a set stores the key and the data
__________ while a map separates the key from the data and only stores the
key and a reference to the data.
D. none of the above
In the Java Collections API, sets and maps are ___________ with a wide variety
of implementations.
A. Object names
The time complexit of the linked implementation of a set would be O(____) if
there were not a count variable in the implementation.
D. none of the above
The time complexity be for the add operation on an array implementation of a
set would be O(_____) if there were not a count variable in the implementation.
D. none of the above
The time complexity of the add operation on a linked implementation would be
O(____) if we chose to add at the end of the list instead of the front?
D. none of the above
users interact with the collection.
both the underlying data structure and the collection.
data and only stores the key and a reference to the data.
variety of implementations.
inherent organization to the elements in the collection.
the way users interact with the collection.
indicate both the underlying data structure and the collection.
organization to the elements in the collection.
and the data together while a map separates the key from the data and only
stores the key and a reference to the data.
are random.
wide variety of implementations.
O(log n) if there were not a count variable in the implementation.
implementation of a set would be O(n) if there were not a count variable in the
implementation.
implementation would be O(n log n) if we chose to add at the end of the list
instead of the front?
What is a set?
What would the time complexity be for the size operation if there were not a
count variable?
What would the time complexity be for the add operation if there were not a
count variable?
What would be the time complexity of the add operation if we chose to add at
the end of the list instead of the front?
What is the difference between a set and a map?
What are the potential advantages of a map over a set?