Deck 21: Standard Template Library Stl

Question 1

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

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

Answer 1

B

Question 2

The multiset associative container does not:

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.

Answer 2

D

Question 3

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

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

Answer 3

A

Question 4

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

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

Question 5

Unlike a vector, a deque:

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 6

The list sequence container does not:

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 7

Iterators are similar to pointers because of the:

A) * and ++ operators.
B) -> operator.
C) begin and end functions.
D) & operator.

Question 8

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

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

Question 9

The erase member function of class vector cannot:

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 10

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

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 11

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

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 12

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

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

Question 13

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

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 14

An STL algorithm cannot:

A) Return an iterator.
B) Take two iterators as arguments to specify a range.
C) Access STL members directly.
D) Be used with containers that support more powerful iterators than the minimum requirements for the algorithm.

Question 15

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

A) vector
B) array
C) list
D) deque

Question 16

Class deque provides:

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 17

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

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

Question 18

The main difference between set and multiset is:

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 19

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

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

Question 20

Which of the following is not an STL container type?

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

Question 21

Which of the following statements is true of a priority_queue?

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 22

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

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).

Question 23

Which of the following function calls is a valid way to place elements into vector< char > chars?

A) std::fill chars.begin), chars.end), '5' );
B) std::fill_n chars.begin), chars.end), '5' );
C) std::generate chars.begin), 10, '5' );
D) std::generate_n 10, chars.end), '5' );

Question 24

The easiest way to search through a list of names and output the first one that begins with a vowel would be to use function:

A) find
B) find_if
C) sort
D) binary_search

Question 25

Select the false statement. Container adapters:

A) Do not provide the actual data structure implementation for elements to be stored.
B) Have their data stored by underlying data structures.
C) Can push and pop elements.
D) Have limited iterator support.

Question 26

To pop an element off the top of a stack for processing:

A) Use member function top.
B) Use member function pop.
C) Use member function top and then member function pop.
D) Use member function pop and then member function top.

Question 27

Which of the following is not a mathematical algorithm included in the STL?

A) min_element
B) copy
C) transform
D) accumulate

Question 28

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

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

Question 29

The for_each function applies a general function to each element in the specified range. This general function should:

A) Take an argument of the elements' type and return nothing.
B) Take an argument of the elements' type and return a value of the elements' type.
C) Take an argument of a non-const reference to the elements' type and return nothing.
D) Take an argument of a non-const reference to the elements' type and return a value of the elements' type.

Question 30

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

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 31

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

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 32

Which algorithm cannot take a predicate function as an argument?

A) find
B) find_if
C) sort
D) binary_search

Question 33

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

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 34

Suppose you have a shopping list stored in a vector. What function would you use to remove all items in that vector that are under 10 dollars and place them in another container?

A) remove
B) remove_copy
C) remove_if
D) remove_copy_if

Question 35

Which of the following is a not a member function of queue?

A) enqueue
B) pop
C) empty
D) size

Question 36

Which of the following is a valid generator function prototype for use with generate or generate_n on a vector< char >?

A) void nextLetter);
B) char nextLetter);
C) char nextLetter char );
D) char nextLetter int );

Question 37

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

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

Question 38

The algorithms in the STL:

A) Use virtual function calls.
B) Are implemented as member functions of the container classes.
C) Do not depend on the implementation details of the containers on which they operate.
D) Are not as efficient as the algorithms presented in most textbooks.

Question 39

The easiest way to set all the values of a vector to zero is to use function:

A) fill
B) fill_n
C) generate
D) generate_n

Question 40

Function mismatch returns:

A) The position number where the two specified sequences do not match.
B) A pair containing the two elements in the specified sequences that do not match.
C) A pair containing two iterators pointing to the two locations in the specified sequences that do not match.
D) A bool indicating whether the two specified sequences do not match.

Question 41

If v1 is a vector< int > containing some number of int elements sorted in ascending order, after these statements execute:
Std::vector< int > results1;
Std::vector< int > results2;
Std::unique_copy v1.begin), v1.end), std::back_inserter results1 ) );
Std::reverse_copy v1.begin), v1.end), std::back_inserter results2 ) );
Which of the following could be true?

A) results1 contains more elements than results2.
B) The first element in results1 matches the last element in results2.
C) results1 is empty but results2 is not.
D) None of the above.

Question 42

Which of the following is not true of a class that will be used to instantiate function objects?

A) It must overload the parentheses operator.
B) It can have data members.
C) It must be a concrete class.
D) All of the above are true about a class that will be used to instantiate function objects.

Question 43

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.

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

Question 44

Which of the following bitset member functions cannot be called with an empty argument list?

A) reset
B) test
C) size
D) none

Question 45

Which of the following function calls would not return the value that is its first argument?

A) std::min 3, 23 )
B) std::min 'N', 'P' )
C) std::max 17, 16 )
D) std::max 'd', 'k' )

Question 46

Attributes of a heap do not include:

A) Having the largest element at the top of the heap.
B) Having a binary-tree structure.
C) The children of a given node are less than or equal to the parent node's value.
D) A preference to pop, rather than push, elements in the heap.

Question 47

Functions iter_swap and swap_ranges are similar in that both:

A) Swap a range of elements.
B) Take two arguments.
C) Take forward iterators as arguments.
D) Can only swap elements within the same array or container.

Question 48

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

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 49

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

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

Question 50

The difference between functions partition and stable_partition is that:

A) partition may throw an exception while stable_partition will not.
B) partition can only be called on a sequence that is already sorted.
C) stable_partition maintains the original order for the elements in each of the two resulting partitions with respect to the other elements in that same partition.
D) stable_partition allows an element to be duplicated and placed into both partitions.

Question 51

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?

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

Question 52

Functions partial_sum and partial_sort are similar in that:

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 53

Function template back_inserter returns:

A) A container.
B) An iterator for a container.
C) An element in a container.
D) A reference to an element in a container.

Question 54

Functions lower_bound, upper_bound and equal_range are different in their:

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

Question 55

Function objects have their functions called by using:

A) The dot operator .)
B) operator)
C) The arrow operator ->)
D) The binary scope resolution operator ::)

Question 56

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?

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) );