Question

What is true about removing an element from a Vector data structure?

	A.	It is computationally cheaper to remove an element at a lower index than it is to remove an element from the higher index.
	B.	The Vector data structure is designed as a container of data; it does not support removal of elements once stored.
	C.	Removing an element at the highest index is always a O(1) operation.
	D.	Removing the highest index element involves shifting size - 1 elements one position to the right.

Answer 1

It is computationally cheaper to remove an element at a highest index than it is to remove an element from the lower index.

Removing the lowest index element involves shifting size - 1 elements one position to the right.

Removing an element at the highest index is always a O(1) operation.
because we just need to decrement the size of vector by 1

So, answer is option c

Removing an element at the highest index is always a O(1) operation.