Question 1

A(n) ____ is the data structure of first choice when you have a list of primitive data types or objects that can be grouped as an array but must be expanded or contracted.
A) array
B) vector
C) object
D) class

Accepted Answer

A vector is a dynamic array that allows for efficient expansion and contraction of the list. It is the data structure of choice when you have a list of primitive data types or objects that can be grouped as an array but must be expanded or contracted. Arrays are not efficient for resizing and can cause memory fragmentation and performance issues. Objects and classes do not have the same functionality as vectors for expanding and contracting arrays. A vector is a dynamic array that can grow or shrink according to the data it contains. This makes it the best choice for a situation where you have a list of data that needs to be expanded or contracted. Arrays have a fixed size, so they cannot be easily resized. Objects and classes are more general data structures that can contain any type of data, but they do not have the same dynamic resizing capabilities as a vector.

Question 2

____ are used to specify which elements in a container are to be operated on when an algorithm is called.
A) Iterators
B) Walkers
C) Sequencers
D) Indexers

Accepted Answer

Iterators are used to point at elements in containers and they help specify which elements in a container are to be operated on when an algorithm is called. Walkers and sequencers are not commonly used terms in C++ and indexers are not used in C++. Iterators are used to specify which elements in a container are to be operated on when an algorithm is called. They allow algorithms to access elements of the container one at a time without knowing the underlying representation of the container. This makes them more flexible than using indexers, which require knowledge of the container's underlying implementation. Walkers and sequencers are not commonly used terms in relation to containers and algorithms.

Question 3

For a one-dimensional array, the first element has an index of ____________________.

Accepted Answer

The answer of For a one-dimensional array, the first element...

Question 4

The STL algorithm ____ removes duplicate adjacent elements in a specified range.
A) duplicate
B) delete
C) unique
D) remove

Accepted Answer

The unique algorithm is used to remove duplicate adjacent elements in a specified range. The unique() algorithm removes consecutive duplicates in a range and returns an iterator pointing to the new end of the range. It does not actually delete or remove any elements from the container or range.

Question 5

Good programming practice requires defining the number-of-items in the array as a(n) ____________________ before declaring the array.

Accepted Answer

The answer of Good programming practice requires defining the number-of-items...

Question 6

The ____ header is required to create one or more vector objects. A) < string > B) < iostream > C) < algorithm > D) < vector >

Accepted Answer

The header is required to create vector objects. This header file provides the implementation of the vector class in C++. The header is required to create one or more vector objects in C++.

Question 7

The STL algorithm ____ assigns every element in a specified range to a specified value.
A) equal
B) fill
C) find
D) unique

Accepted Answer

The fill algorithm assigns every element in a specified range to a specified value. The other options, equal, find, and unique, have different functions in the STL algorithm. The fill algorithm assigns every element in a specified range to a specified value.

Question 8

The STL ____ function returns a value corresponding to the start of the vector.
A) begin()
B) end()
C) rear()
D) last()

Accepted Answer

The STL begin() function returns an iterator pointing to the first element of the vector, which is effectively the start of the vector. The STL begin() function returns an iterator pointing to the first element in the vector, which can be used to access the element or iterate through the vector.

Question 9

To meet the need of providing a tested and generic set of data structures that can be modified, expanded, and contracted, C++ includes a useful set of classes in its ____.
A) Standard Array Library
B) Standard Template Library
C) Standard Data Structure Library
D) Data Structure Library

Accepted Answer

C++ includes the Standard Template Library (STL) which provides a generic set of classes for data structure manipulation that can be expanded, modified, and contracted as needed. The STL includes containers like vector, deque, list, and set, as well as algorithms like sort, search, and copy. C++ includes the Standard Template Library (STL) which provides a set of generic classes and functions for working with data structures such as arrays, lists, stacks, queues, and trees. The STL allows for efficient and flexible implementation of algorithms and data structures. The other choices (A, C, D) are not valid names of libraries in C++.

Question 10

The STL algorithm ____ copies elements from a source range to a destination range.
A) copy
B) copy_backward
C) copy_forward
D) replace

Accepted Answer

The copy algorithm in the STL is designed specifically to copy elements from a source range to a destination range. The copy_backward algorithm is used to copy elements from the end of a source range to the end of a destination range, while the copy_forward algorithm does not exist in the STL. The replace algorithm is used to replace all occurrences of a particular value in a range with a different value. The STL algorithm "copy" is specifically used to copy elements from a source range to a destination range. The other options, "copy_backward" and "copy_forward", are used for copying elements in a different direction or with a different starting point, respectively. "Replace" is not used for copying elements, but rather for replacing specific elements with a new value.

Question 11

Internally, the computer uses the ___________________ as an offset from the array s starting position.

Accepted Answer

The answer of Internally, the computer uses the ___________________ as...

Question 12

In C++, a two-dimensional array is initialized in ____ order.
A) vector
B) linear
C) row
D) column

Accepted Answer

A two-dimensional array is initialized in row order, meaning the elements in the same row are stored contiguously in memory. This allows for efficient iteration over the rows, which is often a common use case. Option A is not applicable, as a vector is a one-dimensional data structure. Option B is also not applicable, as there is no such thing as a "linear" order for a two-dimensional array. Option D is incorrect, as initializing in column order would make iterating over rows less efficient. In C++, a two-dimensional array is initialized in row order. This means that the first index corresponds to the row number and the second index corresponds to the column number.

Question 13

The STL algorithm ____ returns the sum of the numbers in a specified range.
A) count
B) sum
C) max
D) accumulate

Accepted Answer

The accumulate algorithm is designed to return the sum of values in a given range. The count, max, and sum algorithms are not specifically designed for this purpose. The accumulate algorithm takes a range of values and returns the sum of those values.

Question 14

The STL algorithm ____ randomly shuffles element values in a specified range.
A) random
B) rnd_shuffle
C) shuffle
D) random_shuffle

Accepted Answer

The STL algorithm that randomly shuffles element values in a specified range is called random_shuffle. Therefore, the correct choice is D. The correct algorithm to randomly shuffle element values in a specified range is the random_shuffle algorithm provided by the STL.

Question 15

Individual array elements can be displayed using the ___________________ object.

Accepted Answer

The answer of Individual array elements can be displayed using...

Question 16

____ loops are especially useful when dealing with two-dimensional arrays because they allow the programmer to designate and cycle through each element easily.
A) Nested
B) Single
C) Simple
D) Conditional

Accepted Answer

Nested loops are used to iterate through each element in a two-dimensional array. The outer loop cycles through the rows, while the inner loop cycles through the columns. This allows the programmer to designate and access each element in the array easily. Nested loops are the best choice when dealing with two-dimensional arrays because they allow the programmer to cycle through each element easily. The outer loop cycles through the rows, while the inner loop cycles through the columns. This way, every element can be designated and manipulated accordingly.

Question 17

The ____________________ of an array may be omitted when initializing values in the declaration statement.

Accepted Answer

The answer of The ____________________ of an array may be...

Question 18

Conceptually, a ____-dimensional array can be viewed as a book of data tables.
A) one
B) two
C) three
D) four

Accepted Answer

A three-dimensional array can be conceptualized as a book, where each page of the book represents a two-dimensional array (a table of data), and flipping through the pages gives the third dimension.

Question 19

Each STL class is coded as a template that permits the constructing a generic data structure, referred to as a(n) ____.
A) container
B) object
C) structure
D) array

Accepted Answer

The STL classes are templates that allow the creation of generic data structures known as containers. These containers provide a consistent interface for storing and accessing data, making it easier to write reusable and generic code. Therefore, option A is the best choice for this question. STL classes are designed to construct generic data structures called containers, which can hold elements of different data types. The other choices (object, structure, array) do not accurately describe the nature of an STL class.

Question 20

Many compilers automatically set all elements of integer and real value arrays to ____.
A) -100
B) -10
C) -1
D) 0

Accepted Answer

Many compilers automatically set all elements of integer and real value arrays to 0. In most cases, the default value of all elements of integer and real value arrays is 0. This is known as initialization. However, it is good practice to always initialize arrays to a specific value before using them in a program to avoid any unexpected behavior.

Quiz 7: Arrays

A(n) ____ is the data structure of first choice when you have a list of primitive data types or objects that can be grouped as an array but must be expanded or contracted.

____ are used to specify which elements in a container are to be operated on when an algorithm is called.

For a one-dimensional array, the first element has an index of ____________________.

The STL algorithm ____ removes duplicate adjacent elements in a specified range.

Good programming practice requires defining the number-of-items in the array as a(n) ____________________ before declaring the array.

The ____ header is required to create one or more vector objects.

The STL algorithm ____ assigns every element in a specified range to a specified value.

The STL ____ function returns a value corresponding to the start of the vector.

To meet the need of providing a tested and generic set of data structures that can be modified, expanded, and contracted, C++ includes a useful set of classes in its ____.

The STL algorithm ____ copies elements from a source range to a destination range.

Internally, the computer uses the ___________________ as an offset from the array s starting position.

In C++, a two-dimensional array is initialized in ____ order.

The STL algorithm ____ returns the sum of the numbers in a specified range.

The STL algorithm ____ randomly shuffles element values in a specified range.

Individual array elements can be displayed using the ___________________ object.

____ loops are especially useful when dealing with two-dimensional arrays because they allow the programmer to designate and cycle through each element easily.

The ____________________ of an array may be omitted when initializing values in the declaration statement.

Conceptually, a ____-dimensional array can be viewed as a book of data tables.

Each STL class is coded as a template that permits the constructing a generic data structure, referred to as a(n) ____.

Many compilers automatically set all elements of integer and real value arrays to ____.