Question 1

The erase member function of class vector cannot:

Accepted Answer

A)  Specify an element to be removed from the vector. 
B)  Specify a value to be removed from the vector. 
C)  Specify a range of elements to be removed from the vector. 
D)  Be called by member function clear. 
A)  Specify an element to be removed from the vector. 
B)  Specify a value to be removed from the vector. 
C)  Specify a range of elements to be removed from the vector. 
D)  Be called by member function clear. B

Question 2

Assuming that bitset b1 contains the bits [0 1 1 0] and bitset b2 contains the bits [1 1 1 1], which of the following expressions returns true?

Accepted Answer

A)  b1.any() 
B)  b1 == b2 
C)  b1.test(3) 
D)  b2.none() 
A)  b1.any() 
B)  b1 == b2 
C)  b1.test(3) 
D)  b2.none() A

Question 3

Data loss could occur if the contents of a __________ were placed into any of the other three associative container types.

Accepted Answer

A)  multiset. 
B)  set. 
C)  multimap. 
D)  map. 
A)  multiset. 
B)  set. 
C)  multimap. 
D)  map. C

Question 4

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

Accepted Answer

A)  front 
B)  back 
C)  push_front 
D)  push_back 
A)  front 
B)  back 
C)  push_front 
D)  push_back

Question 5

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

Accepted Answer

A)  copy 
B)  remove_if 
C)  find 
D)  Both (a) and (b). 
A)  copy 
B)  remove_if 
C)  find 
D)  Both (a) and (b).

Question 6

Unlike a vector, a deque:

Accepted Answer

A)  Provides efficient insertion and deletion only at its front. 
B)  Does not provide indexed access with the subscript operator. 
C)  Is not stored in contiguous memory. 
D)  Cannot store as many different data types. 
A)  Provides efficient insertion and deletion only at its front. 
B)  Does not provide indexed access with the subscript operator. 
C)  Is not stored in contiguous memory. 
D)  Cannot store as many different data types.

Question 7

The multiset associative container does not:

Accepted Answer

A)  Need a header file to be used. 
B)  Use its comparator function object to determine the order of its data. 
C)  Arrange its data in ascending order by default. 
D)  Permit random access to its keys. 
A)  Need a header file to be used. 
B)  Use its comparator function object to determine the order of its data. 
C)  Arrange its data in ascending order by default. 
D)  Permit random access to its keys.

Question 8

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

Accepted Answer

A)  Input/output, forward, bidirectional, random access. 
B)  Random access, forward, bidirectional, input/output. 
C)  Bidirectional, forward, random access, input/output. 
D)  Input/output, bidirectional, forward, random access. 
A)  Input/output, forward, bidirectional, random access. 
B)  Random access, forward, bidirectional, input/output. 
C)  Bidirectional, forward, random access, input/output. 
D)  Input/output, bidirectional, forward, random access.

Question 9

The main difference between set and multiset is:

Accepted Answer

A)  Their interface. 
B)  That one deals with keys only, and the other deals with key/value pairs. 
C)  Their efficiency. 
D)  How they handle duplicate keys. 
A)  Their interface. 
B)  That one deals with keys only, and the other deals with key/value pairs. 
C)  Their efficiency. 
D)  How they handle duplicate keys.

Question 10

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

Accepted Answer

A)  front 
B)  middle 
C)  back 
D)  pop_back 
A)  front 
B)  middle 
C)  back 
D)  pop_back

Question 11

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

A)  minimize_memory 
B)  shrink_to_fit 
C)  reduce_capacity 
D)  squeeze_to_size 
A)  minimize_memory 
B)  shrink_to_fit 
C)  reduce_capacity 
D)  squeeze_to_size

Question 12

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

Accepted Answer

A)  Access to any element using the [] operator. 
B)  Stored in contiguous blocks of memory. 
C)  The ability to change size dynamically. 
D)  Efficient direct access to any element. 
A)  Access to any element using the [] operator. 
B)  Stored in contiguous blocks of memory. 
C)  The ability to change size dynamically. 
D)  Efficient direct access to any element.

Question 13

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

Accepted Answer

A)  Containers. 
B)  Iterators. 
C)  Algorithms. 
D)  Pointers. 
A)  Containers. 
B)  Iterators. 
C)  Algorithms. 
D)  Pointers.

Question 14

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

Accepted Answer

A)  C-like arrays 
B)  vectors 
C)  strings 
D)  bitsets 
A)  C-like arrays 
B)  vectors 
C)  strings 
D)  bitsets

Question 15

If a program attempts to insert a duplicate key into a set:

Accepted Answer

A)  An exception is thrown. 
B)  The set will contain multiple copies of that key. 
C)  A compile error will occur. 
D)  The duplicate key will be ignored. 
A)  An exception is thrown. 
B)  The set will contain multiple copies of that key. 
C)  A compile error will occur. 
D)  The duplicate key will be ignored.

Question 16

Which of the following statements is true of a priority_queue?

Accepted Answer

A)  It does not allow insertions in sorted order. 
B)  Each of its common operations is implemented as an inline function. 
C)  A bucket sort is usually associated with it. 
D)  It must be implemented as a deque. 
A)  It does not allow insertions in sorted order. 
B)  Each of its common operations is implemented as an inline function. 
C)  A bucket sort is usually associated with it. 
D)  It must be implemented as a deque.

Question 17

Class deque provides:

Accepted Answer

A)  Efficient indexed access to its elements. 
B)  The ability to add storage at either end of the deque. 
C)  Efficient insertion and deletion operations at the front and back of a deque. 
D)  All of the above. 
A)  Efficient indexed access to its elements. 
B)  The ability to add storage at either end of the deque. 
C)  Efficient insertion and deletion operations at the front and back of a deque. 
D)  All of the above.

Question 18

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

Accepted Answer

A)  Forward iterators. 
B)  Bidirectional iterators. 
C)  Random access iterators. 
D)  Input/output iterators. 
A)  Forward iterators. 
B)  Bidirectional iterators. 
C)  Random access iterators. 
D)  Input/output iterators.

Question 19

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

Accepted Answer

A)  Applications that require frequent insertions and deletions at the front of a container. 
B)  Applications that require frequent insertions and deletions in the middle of a container. 
C)  Applications that require frequent insertions and deletions at the back of a container. 
D)  Applications that require frequent insertions and deletions at the front and at the back of a container. 
A)  Applications that require frequent insertions and deletions at the front of a container. 
B)  Applications that require frequent insertions and deletions in the middle of a container. 
C)  Applications that require frequent insertions and deletions at the back of a container. 
D)  Applications that require frequent insertions and deletions at the front and at the back of a container.

Question 20

The expression std::multimap>::value_type(15, 2.7):

Accepted Answer

A)  Creates an empty multimap object. 
B)  Creates a multimap object containing one key/value pair. 
C)  Returns the number of times the key/value pair (15, 2.7) appears in the multimap. 
D)  Creates a pair object in which first is 15 (type int) and second is 2.7 (type double). 
A)  Creates an empty multimap object. 
B)  Creates a multimap object containing one key/value pair. 
C)  Returns the number of times the key/value pair (15, 2.7) appears in the multimap. 
D)  Creates a pair object in which first is 15 (type int) and second is 2.7 (type double).

Exam 15: Standard Library Containers and Iterators

The erase member function of class vector cannot:

Assuming that bitset b1 contains the bits [0 1 1 0] and bitset b2 contains the bits [1 1 1 1], which of the following expressions returns true?

Data loss could occur if the contents of a __________ were placed into any of the other three associative container types.

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:

The multiset associative container does not:

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

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 a difference between vectors and arrays?

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

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

If a program attempts to insert a duplicate key into a set:

Which of the following statements is true of a priority_queue?

Class deque provides:

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

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

The expression std::multimap<int, double, std::less<int>>::value_type(15, 2.7):

Introduction to Computers and C++

Introduction to C Programming; Inputoutput and Operators

Introduction to Classes, Objects and Strings

Control Statements, Assignment, and Operators

Control Statements, Logical Operators

Functions and an Introduction to Recursion

Class Templates Array and Vector; Catching Exceptions

Pointers and Pointer-Based Strings

Classes: a Deeper Look; Throwing Exceptions

Operator Overloading; String and Array Objects

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Stream Inputoutput: a Deeper Look

File Processing

Standard Library Algorithms

Exception Handling: a Deeper Look

Introduction to Custom Templates

Custom Templatized Data Structures

Searching and Sorting

Class String and String Stream Processing

Bits, Characters, C Strings and Structs

Other Topics

C++11 Additional Features

Filters