When you use an array to implement the ADT list, retrieving an entry at a given position is slow. a) true
b) false
When you use an array to implement the ADT list, adding an entry at a the end of the list is fast.
a) true
b) false
When you use a vector to implement the ADT list, retrieving an entry at a given position is slow.
a) true
b) false
When you use a vector to implement the ADT list, adding an entry at a the end of the list is fast.
a) true
b) false

1)FALSE

2)TRUE

3)FALSE

4) FALSE

Explanation:

1) Retrieving an entry at a given position is not slow ( it is done using index number ) hence the answer is FALSE

2) Adding an entry at the end of the list is Fast this is because in using array implementation a new entry is made immediately after the last position and it is done very fast as well. hence the answer is TRUE

3) Retrieving an entry at a given position ( from an ADT list ) that is been implemented using Vector is very fast this is simply because Indexing in vector is done at a fixed time  hence the answer is FALSE

4) Adding an entry at the end of the list is slow using vector  hence answer is FALSE

the components of a vector are the parts of the vectors that are to each other.

b perpendicular