When a data set is small and a hash table not used, what is the better data structure to use?
a. Array
b. Queue
c. Linked list
d. Stack
a. Array
You might also like to view...
Here are several function members of a class. Tell whether each may be used as an l-value, only, an r-value only or both. B is a class that has mutators.
a. //declarations of these appear together in the //definition of class A int& A::f( ){ /* */} const int& A::f( )const{ /* */} b. const int& A::f( ){ /* */} c. const B A::f( ){ /* */} d. B A::f( ){ /* */}
A ____ is a series of intermediate objects between two objects.
A. compound path B. spine C. blend D. gradient
Modify the example program immediately preceding these practice problems to sum the integers from 1 to 10.
What will be an ideal response?
You cannot write a C++ program without relying on some ____.
A. high level code B. procedural code C. machine language D. pseudocode