For our ArrayList based implementation of a map, the contains operation exhibits O(N) order of growth efficiency (where N is the number of elements in the map). public boolean contains(K k)
// Returns true if an entry in this map with key k exists;
// Returns false otherwise.
{
if (k == null)
throw new IllegalArgumentException("Maps do not allow null keys.");
for (MapEntry temp: map)
if (temp. getKey().equals(k))
return true; // k found, exits method
// No entry is associated with k.
return false;
}
a. false
b .true
2. Retrieval of an element from a list is based on using:
[A] the equals method.
[B] the == operator.
[C] aliases.
[D] all attributes being equal.
[E] All of these are correct.
3. Suppose g has been declared to be of type WeightedGraphInterface and instantiated as an object of a class that implements that interface. Assume that g consists of seven vertices A, B, C, D, E, F, G and seven directed edges A-B, B-C, C-D, D-C, D-F, F-B, and G-E with all weights equal to 5. Show the expected output of the section of code below. Assume that capital letters A through G are of type T (the vertex type), that getToVertices returns a queue with the vertices in alphabetical order, that getUnmarked returns unmarked vertices in alphabetical order, that the null edge value is 0, and that printing a vertex displays its corresponding letter.
System. out. println(g. weightIs(A, B) + g. weightIs(B, A) );
a. 5
b. 1
c. 10
d. Exception