Question 1

Which of the following containers is not considered a near container?

Accepted Answer

B

Question 2

Which of the following is not a sequence container provided by the Standard Library?

Accepted Answer

The Standard Library provides several sequence containers such as vector, list, and deque, which are designed to hold sequences of elements. The array, however, is not considered a sequence container in the same sense because its size is fixed at compile-time, unlike the others which can dynamically change size at runtime.

Question 3

Which category of iterators combines the capabilities of input and output iterators into one iterator?

Accepted Answer

Forward iterators combine the capabilities of input and output iterators, allowing both data access and data modification in a single direction through iteration.

Question 4

The main difference between set and multiset is:

Accepted Answer

The main difference between set and multiset is how they handle duplicate keys. Set only allows unique keys, whereas multiset allows duplicate keys. So, option D is the correct choice.

Question 5

Which of the following is not a member function of all sequence containers?

Accepted Answer

Although front(), back(), push_front(), and push_back() are member functions of sequence containers, push_front() is not a member function of all sequence containers. It is specific to deque and list containers, while the others are common to all sequence containers.

Question 6

Which of the following is the correct hierarchy of iterator categories (weakest at the left)?

Accepted Answer

The correct hierarchy, from weakest to strongest, is: Input/output, forward, bidirectional, random access. This reflects the increasing capabilities of the iterators from simply reading or writing in a linear fashion to being able to access elements in any order efficiently.

Question 7

The list sequence container does not:

Accepted Answer

The list sequence container in C++ does not automatically sort inserted items. It efficiently implements insert and delete operations anywhere in the list, uses a doubly linked list, and supports bidirectional iterators. Automatic sorting is not a feature of the list container; elements are kept in the order they are inserted unless explicitly sorted by the programmer.

Question 8

Which of the following is not a member function of all sequence containers?

Accepted Answer

The function "middle" is not a member function of any sequence container in the standard library. The other three functions, front, back, and pop_back, are all member functions of all sequence containers in the standard library.

Question 9

Which of the following are mutating-sequence algorithms defined in the Standard Library?

Accepted Answer

Both copy and remove_if are mutating-sequence algorithms defined in the Standard Library. Copy is used to copy a range of elements to another range, while remove_if is used to remove elements from a range based on a given condition. Find, on the other hand, is a non-mutating sequence algorithm that is used to search for an element in a range.

Question 10

Unlike a vector, a deque:

Accepted Answer

A deque (double-ended queue) is designed to allow efficient insertion and deletion at both its beginning and end, unlike a vector which is optimized for these operations at its end but not its beginning. Unlike arrays and vectors, a deque does not store its elements in contiguous memory; instead, it may use multiple arrays, enabling efficient growth by adding new arrays as needed. This structural difference allows deques to efficiently insert or delete elements at both ends. Deques provide indexed access to their elements just like vectors, and they can store as many different data types as vectors, as long as those types meet the container's requirements.

Question 11

Class deque provides:

Accepted Answer

Class deque provides all of the above features, making it an efficient and versatile container for storing and manipulating elements. It allows for both indexed access and dynamic addition/removal of elements at the front and back.

Question 12

As of C++11, you can ask a vector or deque to return unneeded memory to the system by calling member function shrink_to_fit. This requests that the container reduce its capacity to the number of elements in the container. According to the C++ standard, implementations can ignore this request so that they can perform implementation-specific optimizations.

Accepted Answer

The correct member function to ask a vector or deque to return unneeded memory to the system is shrink_to_fit. The other options (A, C, and D) are not valid member function names for this purpose.

Question 13

A Standard Library algorithm cannot:

Accepted Answer

Standard Library algorithms are designed to work independently of the specific container they are operating on, and as such cannot directly access container-specific members.

Question 14

The erase member function of class vector cannot:

Accepted Answer

The erase member function of class vector can specify an element or a range of elements to be removed by their position (iterator) but cannot directly specify a value to be removed. To remove a specific value, one would typically use the remove-erase idiom, which involves the std::remove function combined with vector::erase.

Question 15

Which of the following applications would a deque not be well suited for?

Accepted Answer

A deque (double-ended queue) allows for constant time insertions and deletions at both the front and back of the container. However, when it comes to frequent insertions and deletions in the middle of the container, it can become inefficient as it requires linear time to shift elements in order to make space for the new element to be inserted. Therefore, choice B would not be well-suited for a deque.

Question 16

Which of the following is not a key component of the Standard Library?

Accepted Answer

Pointers are not a key component of the Standard Library. The Standard Library of C++ provides a set of predefined classes and functions, such as containers, iterators, and algorithms, that make it easier for developers to write efficient, reliable, and portable code. Pointers are a fundamental concept in C++, but they are not specific to the Standard Library.

Question 17

Which of the following statements is false?

Accepted Answer

The statement "Functions rbegin and rend return iterators that can be used to modify data, and rcbegin and rcend return const iterators that cannot be used to modify data" is false. In fact, both rbegin and rcbegin return iterators to the beginning of a reversed sequence, but while rbegin iterators can be used to modify data, rcbegin iterators cannot. Similarly, rend and rcend return iterators to the end of a reversed sequence, but while rend iterators can be used to modify data, rcend iterators cannot.

Question 18

Iterators are similar to pointers because of the:

Accepted Answer

Iterators and pointers both use the * and ++ operators to access and move through elements in a container. While iterators may not be actual pointers, they are designed to offer similar functionality in traversing data structures. The other choices, including the -> operator, begin and end functions, and the & operator, are also important in working with iterators, but are not exclusively shared with pointers.

Question 19

Which of the following is a difference between vectors and arrays?

Accepted Answer

Arrays have a fixed size, while vectors can be resized dynamically.

Question 20

Which of the following is not an Standard Library container type?

Accepted Answer

"Second-class containers" is not a category of Standard Library container types. The other three (sequence containers, associative containers, and container adapters) are valid container types.

Quiz 15: Standard Library Containers and Iterators

Which of the following containers is not considered a near container?

Which of the following is not a sequence container provided by the Standard Library?

Which category of iterators combines the capabilities of input and output iterators into one iterator?

The main difference between set and multiset is:

Which of the following is not a member function of all sequence containers?

Which of the following is the correct hierarchy of iterator categories (weakest at the left) ?

The list sequence container does not:

Which of the following is not a member function of all sequence containers?

Which of the following are mutating-sequence algorithms defined in the Standard Library?

Unlike a vector, a deque:

Class deque provides:

A Standard Library algorithm cannot:

The erase member function of class vector cannot:

Which of the following applications would a deque not be well suited for?

Which of the following is not a key component of the Standard Library?

Which of the following statements is false?

Iterators are similar to pointers because of the:

Which of the following is a difference between vectors and arrays?

Which of the following is not an Standard Library container type?