Q11-Q14 Quick

Front 1

A bit field must be declared as a:

Back 1

int or unsigned

Front 2

Which of the following correctly copies the contents of string2 into string1? Assume that string2 is equal to "goodbye" and string1is equal to "good morning"?

Back 2

strcpy( string1, string2 );

Front 3

The main difference between structures and classes is:

Back 3

A colon as in bitfield : 4

Front 4

Structure variable declarations can be incorporated into a structure definition by placing a comma-separated list of variable names:

Back 4

After the right brace and before the semicolon.

Front 5

Assuming that string1 = "hello" and string2 = "hello world", which of the following returns 0?

Back 5

Strncmp( string1, string2, 5 );

Front 6

To change the string "ABCDEFGHI" to "aaaaaFGHI" you would use the ________ function.

Back 6

memset

Front 7

The strtol and stroul functions do not:

Back 7

Have the same return types.

Front 8

________ is not allowed.

Back 8

Accessing individual bits in a multi-bit bit field

Front 9

typedef is used to:

Back 9

Create a type name that is an alias for another type name.

Front 10

A merge sort operation runs in:

Back 10

O(n log n) time.

Front 11

Which of the following statements about searching algorithms and their efficiency is false?

Back 11

Big O notation is one way to describe how likely it is that a searching algorithm will find its target.

Front 12

Which of the following represents the efficiency of the insertion sort?

Back 12

O(n2)

Front 13

Selection sort has a Big O of:

Back 13

O(n2)

Front 14

An algorithm that requires ________ operations to complete its task on n data elements is said to have linear runtime.

Back 14

2 n + 1

Front 15

The function call string1.erase( 5 ) will:

Back 15

Erase all characters starting from and including the character in position 5 to the end of string1

Front 16

Which of the following cannot be used to concatenate strings?

Back 16

assign

Front 17

Which of the following is not an argument of the assign member function?

Back 17

The end location.

Front 18

Which of the following searches through a string object from right-to-left?

Back 18

find_last_of

Front 19

Which function changes the actual string stored in the string object (i.e., is not a const member function)?

Back 19

resize

Front 20

What is the code for a loop that iterates from the end of a string toward the beginning?

Back 20

srend

i--

Front 21

Which of the following is false?

Back 21

c_str returns a character array of the same length as the string object it is called on.

Front 22

What type of value is returned by the overloaded equality and relational operators for strings?

Back 22

bool

Front 23

Class string has member function ________ to interchange the data stored in two string objects.

Back 23

swap

Front 24

All of the following are true of an ostringstream object except that:

Back 24

A stream insertion operation cannot be used to append additional data to it.

Front 25

Which of the following does not apply to an istringstream object?

Back 25

Data in a string can be appended to it.

Front 26

Which of the following is not overloaded for strings?

Back 26

-=

Front 27

Which of the following returns a bool?

Back 27

empty

Front 28

The arguments passed to replace do not include:

Back 28

The subscript of the element where the replace operation ends.

Front 29

Class templates:

Back 29

Must put template< typename Type > before the class definition.

Front 30

A function template can be overloaded by:

Back 30

Using non-template functions with the same name and different parameters.

Front 31

Assuming that all four of the following functions are defined, which one will be called by the function call square( 23.4 )?

Back 31

double square( double num )

Front 32

Nontype parameters are:

Back 32

Constants.

Front 33

If you have a 1000-element balanced binary search tree, what is the maximum number of comparisons that may be needed to find an element in the tree?

Back 33

10

Front 34

For a non-empty linked list, select the code that should appear in a function that adds a node to the end of the list. newPtr is a pointer to the new node to be added and lastPtr is a pointer to the current last node. Each node contains a pointer nextPtr.

Back 34

lastPtr->nextPtr = newPtr; lastPtr = newPtr

Front 35

A linked list has the functions insertAtFront, removeFromFront, insertAtBack and removeFromBack, which perform operations on nodes exactly as their names describe. Which two functions would most naturally model the enqueue and dequeue operations, respectively, of aqueue?

Back 35

insertAtBack and removeFromFront

Front 36

Which of the following statements about stacks is incorrect?

Back 36

Stacks are first-in, first-out (FIFO) data structures.

Front 37

Which of the following tasks would a binary search tree not be well suited for?

Back 37

Reversing an unsorted sequence.

Front 38

________ is not an advantage of linked lists when compared to arrays.

Back 38

Direct access to any list element.

Front 39

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

Back 39

copy

Front 40

The algorithms in the Standard Library:

Back 40

Do not depend on the implementation details of the containers on which they operate.

Front 41

The ________ function would produce a sequence containing three elements when passed the sequences 1, 2 and 1, 2, 3, 4, 5 as first/second and third/fourth arguments, respectively.

Back 41

set_symmetric_difference

Front 42

Which algorithm cannot take a predicate function as an argument?

Back 42

find

Front 43

The easiest way to set all the values of a vector to zero is to use function:

Back 43

fill

Front 44

Functions lower_bound, upper_bound and equal_range are different in their:

Back 44

Return types.

Front 45

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

Back 45

All of these are true about a class that will be used to instantiate function objects.

Front 46

The ________ function would produce the sequence 1, 5, 6 when passed the sequences 1, 2, 3, 4, 5, 6 and 2, 3, 4, 7 as first/second and third/fourth arguments, respectively

Back 46

set_difference

Front 47

Lambdas begin with the lambda introducer ________, followed by a parameter and function body.

Back 47

[]

Front 48

Sorting a preexisting sequence of n elements can be accomplished with the heapsort algorithm by:

Back 48

Calling make_heap on the entire sequence and then calling sort_heap on the entire sequence.

Front 49

Attributes of a heap do not include:

Back 49

A preference to pop, rather than push, elements in the heap.

Front 50

Given that v1 and v2 are vectors, what is returned by the function callstd::equal( v1.begin(), v1.end(), v2.begin() )

Back 50

A bool indicating whether v1 and v2 are equal.

Front 51

If v1 is a vector< int > containing some number of int elements sorted in ascending order, after these statements execute:std::vector< int > results1; std::vector< int > results2; std::unique_copy( v1.begin(), v1.end(), std::back_inserter( results1 ) ); std::reverse_copy( v1.begin(), v1.end(), std::back_inserter( results2 ) ); which of the following could be true?

Back 51

The first element in results1 matches the last element in results2.

Front 52

The purpose of stack unwinding is to:

Back 52

Attempt to catch exceptions that are not caught in their scope.

Front 53

Select the false statement regarding exceptions.

Back 53

All exception classes are accessible via .

Front 54

Select the false statement. A rethrown exception:

Back 54

Must have been fully processed at the time it was rethrown.

Front 55

The correct order in which an exception is detected and handled is:

Back 55

try, throw, catch

Front 56

An exception:

Back 56

Terminates the block where the exception occurred.

Front 57

catch blocks are not required to contain:

Back 57

A parameter name.

Front 58

Once an exception is thrown, when can control return to the throw point?

Back 58

Never.

Front 59

Which of the following is not an STL container type?

Back 59

Second-class containers.

Front 60

Iterators are similar to pointers because of the:

Back 60

* and ++ operators.

Front 61

An STL algorithm cannot:

Back 61

Access STL members directly.

Front 62

Which of the following is not a sequence container provided by the STL?

Back 62

array.

Front 63

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

Back 63

Applications that require frequent insertions and deletions in the middle of a container.

Front 64

The erase member function of class vector cannot:

Back 64

Specify a value to be removed from the vector.

Front 65

The list sequence container does not:

Back 65

Automatically sort inserted items.

Front 66

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

Back 66

push_front

Front 67

Class deque provides:

Back 67

All of the above.

Front 68

The main difference between set and multiset is:

Back 68

How they handle duplicate keys.

Front 69

Data loss could occur if the contents of a __________ were placed into any of the other three associative container types.

Back 69

multimap.

Front 70

The multiset associative container does not:

Back 70

Permit random access to its keys.

Front 71

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

Back 71

The duplicate key will be ignored.

Front 72

The expression std::multimap< int, double, std::less< int > >::value_type( 15, 2.7 ):

Back 72

Creates a pair object in which first is 15 (type int) and second is 2.7 (type double).

Front 73

If pairs is a map containing int keys and double associated values, the expression pairs[ 5 ] = 10:

Back 73

Associates the value 10.0 to the key 5 in pairs.

Front 74

Select the false statement. Container adapters:

Back 74

Have limited iterator support.

Front 75

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

Back 75

Use member function top and then member function pop.

Front 76

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

Back 76

enqueue.

Front 77

Which of the following statements is true of a priority_queue?

Back 77

Each of its common operations is implemented as an inline function.

Front 78

The algorithms in the STL:

Back 78

Are implemented as member functions of the container classes.

Front 79

The easiest way to set all the values of a vector to zero is to use function:

Back 79

fill.

Front 80

Given that v1 and v2 are vectors, the function call std::equal( v1.begin(), v1.end(), v2.begin() ) returns:

Back 80

A bool indicating whether v1 and v2 are equal.

Front 81

Mr. Smith has a shopping list stored in a vector. Today, Mrs. Smith decides that she will go get the items that cost less than 10 dollars. If Mr. Smith wants to give his wife a list of her own, he should use the function:

Back 81

remove_copy_if.

Front 82

The order of the arguments passed to function replace_copy_if must be:

Back 82

InputIterator, InputIterator, OutputIterator, PredicateFunction, ReplacementValue

Front 83

The easiest way to search through a list of names and output the first one that begins with a vowel would be to use function:

Back 83

find_if.

Front 84

Functions iter_swap and swap_ranges are similar in that both:

Back 84

Take forward iterators as arguments.

Front 85

Which of the following statements produces identical results as the statement: std::copy( v1.begin(), v1.end(), v2.begin() );if v1 and v2 are both 10-element vectors?

Back 85

std::copy_backward( v1.begin(), v1.end(), v2.end() );.

Front 86

Functions lower_bound, upper_bound and equal_range are different in their:

Back 86

Return types.

Front 87

Attributes of a heap do not include:

Back 87

A preference to pop, rather than push, elements in the heap.

Front 88

Which of the following bitset member functions cannot be called with an empty argument list?

Back 88

test.

Front 89

Function objects have their functions called by using:

Back 89

operator().

Front 90

Structure variable declarations can be incorporated into a structure definition by placing a comma-separated list of variable names:

Back 90

After the right brace and before the semicolon

Front 91

Two structure variables of the same type with the same member values, when compared will:

Back 91

Result in a compile error.

Front 92

Arrays are:

Back 92

Passed by reference unless inside a structure.

Front 93

typedef is used to:

Back 93

Create a type name that is an alias for another type name.

Front 94

The advantages of using typedef do not include:

Back 94

Increasing the efficiency of accessing struct member variables.

Front 95

Which is the proper way to create an array of structure variables of type Data?

Back 95

Data MyArray[ 10 ];.

Front 96

The most basic unit of data on a computer is the:

Back 96

Bit.

Front 97

Which of the following is not a bitwise operator?

Back 97

*.

Front 98

Let Bit1 = Bit2 = 1. Which of the following does not have the same result as the others?

Back 98

Bit1 ^ Bit2.

Front 99

Evaluate ( 00001000 & 11000101 ) ^ ( 11110000 )

Back 99

11110000.

Front 100

Let x be an unsigned int on a machine with 4-byte unsigned ints. What effect does x>>=1; x<<=1;have?

Back 100

The rightmost bit of x is set to 0.

Front 101

For any 8-bit x, which of the following does not result in zero?

Back 101

x |= x.

Front 102

A bit field must be declared as a:

Back 102

int or unsigned.

Front 103

The number of bits in a bit field is specified with:

Back 103

A colon as in bitfield : 4.

Front 104

__________ is not allowed.

Back 104

Accessing individual bits in a multi-bit bit field

Front 105

The number 4 typically takes up _________ bit(s) when stored as a character on most of today’s computers.

Back 105

Eight.

Front 106

The functions of the character-handling library typically manipulates characters as:

Back 106

ints

Front 107

The isxdigit function would return false on:

Back 107

g

Front 108

The strtol and stroul functions do not:

Back 108

Have the same return types

Front 109

The main difference between the functions atof, atoi and atol is:

Back 109

Their return types.

Front 110

Which function would be the most useful for determining if a certain word is contained in a string representing a sentence?

Back 110

strstr.

Front 111

What is the output of the following statement? cout << strspn("Cows like to moo.", "Ceik losw");

Back 111

10.

Front 112

The ___________ function allows characters of one part of a string to be copied into another, overlapping part of the same string.

Back 112

memmove.

Front 113

memcmp would return ___________ for the call memcmp("Hi, how are you?", "Hi, how are things?", 6).

Back 113

0.

Front 114

To change the string "ABCDEFGHI" to "aaaaaFGHI" you would use the _________ function.

Back 114

memset.