Archives

We use ____ to implement mergesort. a. recursion b. iteration c. revision d. succession The syntax for accessing a class (struct) member using the operator -> is ____. a. pointerVariableName.classMemberName b. pointerVariableName->classMemberName c. pointerVariableName&->classMemberName d. &pointerVariableName.classMemberName Answer: B A binary […]

In a circular linked list with more than one node, it is convenient to make the pointer first point to the middle node of the list. Software engineers typically break the software development process into the following four phases: analysis, […]

To specify a function as a formal parameter to another function, we specify the function type, followed by the function name as a pointer, followed by the parameter types of the function. To implement hashing, we use four arrays. Answer: […]

A ____ contains a function that can be treated as a function using the function call operator, (). a. function object b. reference object c. property object d. value object The containers map and multimap manage their elements in the […]

If class dog has a derived class retriever, which of the following is true? a. In the case of single inheritance, dog can have no other derived classes. b. In the case of single inheritance, retriever is derived from no […]

If the list is stored in a linked list, we can traverse the list in only one direction starting at the first node because the links are only in one direction. A friend function is a member function of a […]

____ is when more and more new keys would likely be hashed to the array slots that are already occupied. a. Globbing b. Adjacency c. Clustering d. Affinity The ____ contains algorithms that only look at the elements in a […]

Let G be an undirected graph. G is called ____ if any two vertices in G are connected. a. weakly connected b. completely connected c. strongly connected d. inversely connected The scope resolution operator is ____. a. : b. * […]

Like function templates, ____ are used to write a single code segment for a set of related classes. a. function types b. class templates c. inherited classes d. protected members In the function ____, the growth rate is exponential. a. […]

The class pair has two constructors: the default constructor and a constructor with two parameters. If two nonidentical keys are hashed to the same home position then the same probe sequence is followed for both keys. Answer: T The statement […]

The statement ____ declares list to be an array of five integers. a. int [5] list; b. int list[5]; c. int list[]; d. int list[]={0,1,2,3,4,5}; The balance factor of x, written bf(x), is defined by ____. a. bf(x)= xl ” […]

A(n) ____ finds the location of the smallest element in the unsorted portion of the list and moves it to the top of the unsorted portion of the list. a. selection sort algorithm b. quicksort algorithm c. insertion sort algorithm […]

Because an AVL tree is a binary search tree, the search algorithm for an AVL tree is the same as the search algorithm for a binary search tree. The front of the queue is accessed whenever a new element is […]

The first form of ____ uses the equality criteria. a. adjacent_search b. adjacent_query c. adjacent_find d. adjacent_criteria In ____, the elements of the list are viewed as sublists at a particular distance. a. quicksort b. Shellsort c. bubble sort d. […]

____ use a looping structure, such as while, for, or do. . .while, to repeat a set of statements. a. Recursive control structures b. Iterative control structures c. Sequential control structures d. Decisions structures In the STL container list, the […]

If the sequential search is unsuccessful, -1 is returned. The performance of a binary search tree depends on the width of the tree. Answer: F Prior to the deleteQueue operation, the queue must exist and must not be full. Answer: […]

In the breadth first topological ordering, we first find a vertex that has a predecessor vertex and place it first in the topological ordering. A sequential search works efficiently for large lists. Answer: F The function copyStack makes a copy […]

____ iterators, with write access, step forward element-by-element. a. Output b. Input c. Random access d. Step A(n) ____ is a collection of a fixed number of components. a. object b. member c. class d. friend Answer: C The ability […]