Question 1

Elements can be inserted in the middle of a deque container.

Accepted Answer

A) True 
 B)False

Question 2

Containers are essentially used ____.

Accepted Answer

A)  to manipulate data 
B)  to step through a set of given elements 
C)  to manage objects of a given type 
D)  to update objects that are part of a given set of elements 
A)  to manipulate data 
B)  to step through a set of given elements 
C)  to manage objects of a given type 
D)  to update objects that are part of a given set of elements

Question 3

The class vector contains only one constructor.

Accepted Answer

A) True 
 B)False

Question 4

The ____ provides class templates to process lists (contiguous or linked), stacks, and queues.

Accepted Answer

A)  STL 
B)  ITL 
C)  CTL 
D)  ADL 
A)  STL 
B)  ITL 
C)  CTL 
D)  ADL

Question 5

The deque class is a type of container adapter.

Accepted Answer

A) True 
 B)False

Question 6

Assuming deq is a deque object. the expression deq.back() returns the position of the last element of deq.

Accepted Answer

A) True 
 B)False

Question 7

A vector is a type of ____.

Accepted Answer

A)  associative container 
B)  sequence container 
C)  container adapter 
D)  iterator 
A)  associative container 
B)  sequence container 
C)  container adapter 
D)  iterator

Question 8

If the data needs to be processed in a Last In First Out (LIFO) manner, we typically use a(n) ____.

Accepted Answer

A)  queue 
B)  map 
C)  hash table 
D)  stack 
A)  queue 
B)  map 
C)  hash table 
D)  stack

Question 9

To use a deque container in a program, the program must include the statement ____.

Accepted Answer

A) # include B) # include C) #include D) # include A) # include B) # include C) #include D) # include

Question 10

The statement vecList.pop_back() puts the last deleted element back on the vector.

Accepted Answer

A) True 
 B)False

Question 11

Containers are class templates.

Accepted Answer

A) True 
 B)False

Question 12

The effect of the expression rAccessIterator - n is that it ____.

Accepted Answer

A)  deletes the nth element of the iterator 
B)  returns the iterator of the next nth element 
C)  returns the iterator of the previous nth element 
D)  moves rAccessIterator backwards n elements 
A)  deletes the nth element of the iterator 
B)  returns the iterator of the next nth element 
C)  returns the iterator of the previous nth element 
D)  moves rAccessIterator backwards n elements

Question 13

Forward iterators combine all of the functionality of input iterators and almost all the functionality of output iterators.

Accepted Answer

A) True 
 B)False

Question 14

The class deque contains only one constructor.

Accepted Answer

A) True 
 B)False

Question 15

A ____ encapsulates data, and operations on that data, into a single unit.

Accepted Answer

A)  class 
B)  function 
C)  generic 
D)  member 
A)  class 
B)  function 
C)  generic 
D)  member

Question 16

The function ____ returns a pointer to the last element into a container.

Accepted Answer

A)  rbegin 
B)  beginr 
C)  rend 
D)  endr 
A)  rbegin 
B)  beginr 
C)  rend 
D)  endr

Question 17

____ iterators, with read access, step forward element-by-element and so return the values element-by-element.

Accepted Answer

A)  Standard 
B)  Input 
C)  Output 
D)  Migration 
A)  Standard 
B)  Input 
C)  Output 
D)  Migration

Question 18

Every container contains the typedef reverse_iterator.

Accepted Answer

A) True 
 B)False

Question 19

To use the template function copy, the program must include the statement ____.

Accepted Answer

A) # include B) #include

C) # include D) # include A) # include B)  #include C) # include D) # include

Question 20

The expression vecList.front() moves an element to the front of the vector.

Accepted Answer

A) True 
 B)False

Elements can be inserted in the middle of a deque container.

Containers are essentially used ____.

The class vector contains only one constructor.

The ____ provides class templates to process lists (contiguous or linked), stacks, and queues.

The deque class is a type of container adapter.

Assuming deq is a deque object. the expression deq.back() returns the position of the last element of deq.

A vector is a type of ____.

If the data needs to be processed in a Last In First Out (LIFO) manner, we typically use a(n) ____.

To use a deque container in a program, the program must include the statement ____.

The statement vecList.pop_back() puts the last deleted element back on the vector.

Containers are class templates.

The effect of the expression rAccessIterator - n is that it ____.

Forward iterators combine all of the functionality of input iterators and almost all the functionality of output iterators.

The class deque contains only one constructor.

A ____ encapsulates data, and operations on that data, into a single unit.

The function ____ returns a pointer to the last element into a container.

____ iterators, with read access, step forward element-by-element and so return the values element-by-element.

Every container contains the typedef reverse_iterator.

To use the template function copy, the program must include the statement ____.

The expression vecList.front() moves an element to the front of the vector.

Software Engineering Principles and C++ Classes

Object-Oriented Design OOD and C++

Pointers and Array-Based Lists

Linked Lists

Recursion

Stacks

Queues

Searching and Hashing Algorithms

Sorting Algorithms

Binary Trees and B-Trees

Graphs

Standard Template Library (STL) II

Filters

Exam 4: Standard Template Library (STL) I

Elements can be inserted in the middle of a deque container.

Containers are essentially used ____.

The class vector contains only one constructor.

The ____ provides class templates to process lists (contiguous or linked), stacks, and queues.

The deque class is a type of container adapter.

Assuming deq is a deque object. the expression deq.back() returns the position of the last element of deq.

A vector is a type of ____.

If the data needs to be processed in a Last In First Out (LIFO) manner, we typically use a(n) ____.

To use a deque container in a program, the program must include the statement ____.

The statement vecList.pop_back() puts the last deleted element back on the vector.

Containers are class templates.

The effect of the expression rAccessIterator - n is that it ____.

Forward iterators combine all of the functionality of input iterators and almost all the functionality of output iterators.

The class deque contains only one constructor.

A ____ encapsulates data, and operations on that data, into a single unit.

The function ____ returns a pointer to the last element into a container.

____ iterators, with read access, step forward element-by-element and so return the values element-by-element.

Every container contains the typedef reverse_iterator.

To use the template function copy, the program must include the statement ____.

The expression vecList.front() moves an element to the front of the vector.

Software Engineering Principles and C++ Classes

Object-Oriented Design OOD and C++

Pointers and Array-Based Lists

Linked Lists

Recursion

Stacks

Queues

Searching and Hashing Algorithms

Sorting Algorithms

Binary Trees and B-Trees

Graphs

Standard Template Library (STL) II

Filters