Deck 21: Standard Template Library

Question 1

A ____ is a sequence container.

A) vector
B) stack
C) queue
D) set

Answer 1

A

Question 2

____ returns the maximum number of elements that can be inserted into the vector container vecCont without reallocation.

A) vecCont.size()
B) vecCont.max_size()
C) vecCont.capacity()
D) vecCont.length()

Answer 2

C

Question 3

A container's ____ executes when the object goes out of scope.

A) default constructor
B) destructor
C) copy constructor
D) iterator

Answer 3

B

Question 4

Functions begin and end do not take any parameters.

Question 5

The name of the class that implements the vector container is container.

Question 6

The container member function ____ returns the position of one past the last element in the container.

A) last
B) end
C) back
D) pop

Question 7

The ____ operation returns a pointer to the position before the first element in container ct.

A) ct.front()
B) ct.rbegin()
C) ct.rend()
D) ct.end()

Question 8

If the data needs to be processed in a(n) ____ manner, use a queue.

A) FILO
B) LILO
C) LIFO
D) FIFO

Question 9

All containers use the same names for the common operations.

Question 10

The vector container stores and manages its objects in a dynamic array.

Question 11

Input iterators, with read access, step forward element by element.

Question 12

An iterator to a vector container is declared using the ____ iterator.

A) new
B) vector
C) typedef
D) typeiter

Question 13

Every object in a(n) ____ container has a specific position.

A) adapter
B) sequence
C) associative
D) static

Question 14

The definition of the function template copy is contained in the header file ____.

A) algorithm
B) copy
C) ioinput
D) std

Question 15

The first element in a vector container is at location 1.

Question 16

You must use the container name, the container element type, and the scope resolution operator to use the typedef iterator.

Question 17

If data needs to be processed in a LIFO manner, use a ____.

A) stack
B) linked list
C) queue
D) deque

Question 18

The deq.front() operation on a deque object checks whether the container is empty.

Question 19

The ____ operation on a vector container deletes the last element.

A) vecList.pop_back()
B) vecList.pop()
C) vecList.push_back()
D) vecList.back()

Question 20

The STL has three main components: ____.

A) containers, iterators, and algorithms
B) functions, iterators, and algorithms
C) containers, constants, and algorithms
D) containers, iterators, and procedures

Question 21

Random access iterators are ____ iterators that can randomly process the elements of a container.

A) bidirectional
B) forward
C) input
D) output

Question 22

The class ____ contains the definition of an output stream iterator.

A) iostream
B) iostream_iterator
C) ostream
D) ostream_iterator

Question 23

The ____________________ iterators are used to output data from a program into an output stream.

Question 24

The ____ typedef iterator is common to all containers.

A) random_access
B) bidirectional
C) pointer
D) forward

Question 25

Predicates are special types of function objects that return ____ values.

A) character
B) string
C) Boolean
D) Integer

Question 26

In the ____ sort algorithm, the array containing the data is viewed as a binary tree.

A) modifying
B) heap
C) nonmodifying
D) numeric

Question 27

If consecutive elements in listCont have the same value, the ____ operation removes the duplicates.

A) listCont.remove()
B) listCont.duplicate()
C) listCont.remove(duplicate)
D) listCont.unique()

Question 28

The ____ operation removes the first element from the deque object deq.

A) deq.front()
B) deq.push_front()
C) deq.pop_front()
D) deq.push()

Question 29

Elements in a(n) ____ container are automatically sorted according to some ordering criteria.

A) sequence
B) associative
C) sorted
D) adapter

Question 30

____ is a modifying algorithm.

A) min
B) find
C) merge
D) count

Question 31

____ is a nonmodifying algorithm.

A) equal
B) copy
C) fill
D) sort

Question 32

If a container is declared as ____, then we must prevent the iterator from modifying the elements of the container, especially accidentally.

A) static
B) const
C) public
D) private

Question 33

The associated header file of the sequence container multimap is ____________________.

Question 34

The only difference between the containers set and multiset is that the container multiset allows ____________________.

Question 35

List containers are implemented as doubly ____________________.

Question 36

A function object contains a function that can be treated as a function using the ____ operator.

A) *
B) ::
C) ()
D) .

Question 37

The expression ct.____________________ deletes all of the elements from the container ct.

Question 38

____________________ iterators are forward iterators that can also iterate backward over the elements.

Question 39

____ containers allow elements to be inserted at both ends.

A) Queue
B) Deque
C) Stack
D) List

Question 40

Every container contains the typedef ____________________.An iterator of this type is used to iterate through the elements of a container in reverse.

Question 41

____________________ predicates check a specific property for a single argument.