Question 1

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

Accepted Answer

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

Question 2

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

Accepted Answer

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

Question 3

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

Question 4

Functions iter_swap and swap_ranges are similar in that both:

Accepted Answer

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

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

Accepted Answer

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

Question 6

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

Accepted Answer

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

Question 7

Which algorithm cannot take a predicate function as an argument?

Accepted Answer

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

Question 8

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 9

Select the false statement. Container adapters:

Accepted Answer

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

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

Accepted Answer

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

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 12

Attributes of a heap do not include:

Accepted Answer

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

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

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 14

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 15

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)

Question 16

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

Accepted Answer

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

Question 17

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?

Accepted Answer

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

Question 18

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 19

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 20

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

Accepted Answer

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

Exam 21: Standard Template Library Stl

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

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

The main difference between set and multiset is:

Functions iter_swap and swap_ranges are similar in that both:

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

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

Which algorithm cannot take a predicate function as an argument?

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

Select the false statement. Container adapters:

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

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

Attributes of a heap do not include:

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

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

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?

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

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?

Unlike a vector, a deque:

Which of the following statements is true of a priority_queue?

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

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