Lists, Iterators, Deques, Bad Vector Usage

Question 1

What do you use to traverse a list

Answer 1

an iterator

list <type>::iterator lit;
list <type>::const_iterator lit;</type></type>

Question 2

A list allows for which insertion and deletion methods

Answer 2

push front, push back
pop front, pop back

Question 3

To traverse a data structure in reverse order using an iterator you have to use

Answer 3

rbegin and rend

Question 4

T/F You can insert into vectors, too, but you should not

Answer 4

True. This is due to its run time complexity being O(n^2)

Question 5

A dequeue stands for a

Answer 5

double ended queue

Question 6

A dequeue behaves like a vector with the proviso that

Answer 6

you can insert or delete from either end of the dequeue with high efficiency

Question 7

When should i use a vector?

Answer 7

When you are either simply accessing n elements, or if you are calling only push_back / pop_back

Question 8

When should i use a dequeue

Answer 8

If you want to call push_front / pop_front in addition to push_back / pop_back

Question 9

When should i use a list

Answer 9

If you want to insert and delete elements from the middle of the data structure