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.

Question 2

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 3

Functions lower_bound, upper_bound and equal_range are different in their:

Accepted Answer

A)  Return types. 
B)  First argument types. 
C)  Second argument types. 
D)  Third argument types. 
A)  Return types. 
B)  First argument types. 
C)  Second argument types. 
D)  Third argument types.

Question 4

The order of the arguments passed to function replace_copy_if must be:

Accepted Answer

A)  OutputIterator, InputIterator, ReplacementValue, PredicateFunction. 
B)  InputIterator, OutputIterator, PredicateFunction, ReplacementValue. 
C)  OutputIterator, InputIterator, InputIterator, ReplacementValue, PredicateFunction. 
D)  InputIterator, InputIterator, OutputIterator, PredicateFunction, ReplacementValue. 
A)  OutputIterator, InputIterator, ReplacementValue, PredicateFunction. 
B)  InputIterator, OutputIterator, PredicateFunction, ReplacementValue. 
C)  OutputIterator, InputIterator, InputIterator, ReplacementValue, PredicateFunction. 
D)  InputIterator, InputIterator, OutputIterator, PredicateFunction, ReplacementValue.

Question 5

The list sequence container does not:

Accepted Answer

A)  Efficiently implement insert and delete operations anywhere in the list. 
B)  Use a doubly linked list. 
C)  Support bidirectional iterators. 
D)  Automatically sort inserted items. 
A)  Efficiently implement insert and delete operations anywhere in the list. 
B)  Use a doubly linked list. 
C)  Support bidirectional iterators. 
D)  Automatically sort inserted items.

Question 6

Which of the following is not an STL container type?

Accepted Answer

A)  Second-class containers. 
B)  Sequence containers. 
C)  Associative containers. 
D)  Container adapters. 
A)  Second-class containers. 
B)  Sequence containers. 
C)  Associative containers. 
D)  Container adapters.

Question 7

If pairs is a map containing int keys and double associated values, the expression pairs[ 5 ] = 10:

Accepted Answer

A)  Associates the value 10.0 to the key 5 in pairs. 
B)  Associates the value 5.0 to the key 10 in pairs. 
C)  Associates the value associated with key 10 to key 5 in pairs. 
D)  Associates the value associated with key 5 to key 10 in pairs. 
A)  Associates the value 10.0 to the key 5 in pairs. 
B)  Associates the value 5.0 to the key 10 in pairs. 
C)  Associates the value associated with key 10 to key 5 in pairs. 
D)  Associates the value associated with key 5 to key 10 in pairs.

Question 8

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 9

Given that v1 and v2 are vectors, the function call std::equal v1.begin), v1.end), v2.begin) ) returns:

Accepted Answer

A)  A bool indicating whether v1 and v2 are equal. 
B)  A bool indicating whether the first element of v1, the last element of v1 and the first element of v2 are all equal. 
C)  An iterator pointing to the first location where v1 and v2 are equal. 
D)  An iterator pointing to the first location where v1 and v2 are not equal. 
A)  A bool indicating whether v1 and v2 are equal. 
B)  A bool indicating whether the first element of v1, the last element of v1 and the first element of v2 are all equal. 
C)  An iterator pointing to the first location where v1 and v2 are equal. 
D)  An iterator pointing to the first location where v1 and v2 are not equal.

Question 10

The __________ function would produce a sequence containing 3 elements when passed the sequences 1, 2 and 1, 2, 3, 4, 5 as first/second and third/fourth arguments, respectively.

Accepted Answer

A)  set_intersection 
B)  set_difference 
C)  set_union 
D)  set_symmetric_difference 
A)  set_intersection 
B)  set_difference 
C)  set_union 
D)  set_symmetric_difference

Question 11

Which of the following statements produces the same results as the statement:
Std::copy v1.begin), v1.end), v2.begin) );
If v1 and v2 are both 10-element vectors?

Accepted Answer

A)  std::copy_backward v1.begin), v1.end), v2.begin) ); 
B)  std::copy_backward v2.begin), v2.end), v1.begin) ); 
C)  std::copy_backward v1.begin), v1.end), v2.end) ); 
D)  std::copy_backward v2.begin), v2.end), v1.end) ); 
A)  std::copy_backward v1.begin), v1.end), v2.begin) ); 
B)  std::copy_backward v2.begin), v2.end), v1.begin) ); 
C)  std::copy_backward v1.begin), v1.end), v2.end) ); 
D)  std::copy_backward v2.begin), v2.end), v1.end) );

Question 12

Sorting a preexisting sequence of n elements can be accomplished with the heapsort algorithm by:

Accepted Answer

A)  Calling make_heap on the entire sequence and then calling pop_heap on the entire sequence n times. 
B)  Calling push_heap on the entire sequence n times and then calling pop_heap on the entire sequence n times. 
C)  Calling make_heap on the entire sequence and then calling sort_heap on the entire sequence. 
D)  Calling push_heap on the entire sequence n times and then calling sort_heap on the entire sequence. 
A)  Calling make_heap on the entire sequence and then calling pop_heap on the entire sequence n times. 
B)  Calling push_heap on the entire sequence n times and then calling pop_heap on the entire sequence n times. 
C)  Calling make_heap on the entire sequence and then calling sort_heap on the entire sequence. 
D)  Calling push_heap on the entire sequence n times and then calling sort_heap on the entire sequence.

Question 13

Functions partial_sum and partial_sort are similar in that:

Accepted Answer

A)  Both perform their tasks on only part of a sequence and never the whole sequence. 
B)  Both take two iterators as arguments. 
C)  Both are overloaded to take a binary function as an extra argument. 
D)  None of the above. 
A)  Both perform their tasks on only part of a sequence and never the whole sequence. 
B)  Both take two iterators as arguments. 
C)  Both are overloaded to take a binary function as an extra argument. 
D)  None of the above.

Question 14

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 15

Which of the following is not a key component of the STL?

Accepted Answer

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

Question 16

Part of the functionality of member function _________ can be performed by member function lower_bound.

Accepted Answer

A)  equal_range 
B)  find 
C)  count 
D)  insert 
A)  equal_range 
B)  find 
C)  count 
D)  insert

Exam 21: Standard Template Library Stl

The erase member function of class vector cannot:

The multiset associative container does not:

Functions lower_bound, upper_bound and equal_range are different in their:

The order of the arguments passed to function replace_copy_if must be:

The list sequence container does not:

Which of the following is not an STL container type?

If pairs is a map containing int keys and double associated values, the expression pairs[ 5 ] = 10:

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

Given that v1 and v2 are vectors, the function call std::equal v1.begin), v1.end), v2.begin) ) returns:

The __________ function would produce a sequence containing 3 elements when passed the sequences 1, 2 and 1, 2, 3, 4, 5 as first/second and third/fourth arguments, respectively.

Which of the following statements produces the same results as the statement: Std::copy v1.begin), v1.end), v2.begin) ); If v1 and v2 are both 10-element vectors?

Sorting a preexisting sequence of n elements can be accomplished with the heapsort algorithm by:

Functions partial_sum and partial_sort are similar in that:

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

Which of the following is not a key component of the STL?

Part of the functionality of member function _________ can be performed by member function lower_bound.

Introduction to Computers, the Internet and the World Wide Web

Introduction to C Programming

Control Statements, Part 1

Control Statements, Part 2

Functions and an Introduction to Recursion

Arrays and Vectors

Pointers and Pointer-Based Strings

Sequential-Access Files

Classes

Classes: a Deeper Look, Part 2

Operator Overloading; String and Array Objects

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Templates

Stream Inputoutput

Exception Handling

File Processing

Class String and String Stream Processing

Searching and Sorting

Data Structures

Bits, Characters, C Strings and Structs

Boost Libraries, Technical Report 1 and C0x

Other Topics

ATM Case Study, Part 1: Object-Oriented Design With the Uml

ATM Case Study, Part 2: Implementing an Object-Oriented Design

Game Programming With Ogre

Filters