GD2 - 4.12 C++ The Standard Template Library Test

· In C++ A vector is

• An object with magnitude and direction

• a kind of sequential container provided by the STL. It acts like a dynamic array.

• just another name for an array

• None of these

True or false, · It’s very efficient to iterate through a vector. It’s also very efficient to insert or remove an element from the end of a vector.

• True

• False

It can be inefficient to insert or delete elements from the middle of a vector, especially if the vector is large.

• True

• False

vector.push_back removes a value to the end of the vector

• true

• false

vector.pop_back removes a value to the end of the vector

• true

• false

It’s not very efficient to iterate through a vector.

• True

• False

It’s not very efficient to insert or remove an element from the end of a vector.

• True

• False

To get the value referenced by an iterator, you must dereference the iterator using the dereference operator (*).

• True

• False

Iterators are used to point at the memory addresses of STL containers.

• True

• False

We cannot use iterators to move through the contents of the vector.

• True

• False