Seatwork (SEQUENTIAL CONTAINER TYPES) data structure

TRUE OR FALSE

The 'vector' essentially means double-ended-queue and works similar in a fashion as queues.

• True

• False

TRUE OR FALSE

Forward List is preferred over the list when only forward traversal is required (same as the singly linked list is preferred over doubly linked list) as we can save space. Some example cases are, chaining in hashing, adjacency list representation of the graph, etc.

• True

• False

TRUE OR FALSE

Forward list are sequence containers that allow constant time insert and erase operations anywhere within the sequence.

• TRUE

• FALSE

TRUE OR FALSE

With C++11, it is not possible for vector or deque to release unneeded memory back to the system with the help of a function called shrink_to_fit().

• TRUE

• FALSE

TRUE OR FALSE

Compared to static sequence containers, both forward_list and list are fast to find a location in the list. 

• TRUE

• FALSE

It uses vector as its core data structure implementation and can be expanded and contracted

• Vector

• Array

• Forward list

• Deque

This function removes the particular element from the forward list mentioned in its argument.

• remove_if()

• remove()

• clear()

• splice_after()

This function is used to assign values to the forward list, its other variant is used to assign repeated elements and using the values of another list.

• emplace_front()

• insert_after()

• assign()

• pop_front()

True/False

The Vector has a built-in capability of storage management.

• TRUE

• FALSE

What Sequential Container can resize itself?

• Deque

• Vector

• Array

• List