Data Structures Using C++ 2nd Edition

We use ____ to implement mergesort. a. recursion b. iteration c. revision d. succession Answer: A Answer: A Answer: A 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 Answer: B Answer: B A binary search can be performed only on ____. a. unordered lists b. arrays c. comparable lists d. ordered lists Answer:

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. Answer: F Answer: F Answer: F Software engineers typically break the software development process into the following four phases: analysis, design, implementation, and testing and debugging. Answer: T Answer: T Answer: T The

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. Answer: T Answer: T Answer: T To implement hashing, we use four arrays. Answer: F Answer: F Answer: F The first form of the function transform has three

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 Answer: A Answer: A Answer: A The containers map and multimap manage their elements in the form ____. a. key/pair b. name/value c. value/pair d. index/key Answer: A Answer: A Answer: A The algorithm

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 other class except dog. c. The relationship between these classes implies that dog

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. Answer: T Answer: T Answer: T A friend function is a member function of a class but only has access to the

____ 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 Answer: C Answer: C Answer: C The ____ contains algorithms that only look at the elements in a container and that move the elements of a container. a. ATL b. DTL c. ASTL d.

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 Answer: C Answer: C Answer: C The scope resolution operator is ____. a. : b. * c. :: d. ; Answer: C Answer: C Answer: C The output of ____ is immediately sent to

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 Answer: B Answer: B Answer: B In the function ____, the growth rate is exponential. a. g(n)=1 b. g(n)=n2 c. g(n)=nlog2n d. g(n)=2n Answer: D Answer: D Answer: D A ____

The class pair has two constructors: the default constructor and a constructor with two parameters. Answer: T Answer: T Answer: T If two nonidentical keys are hashed to the same home position then the same probe sequence is followed for both keys. Answer: T Answer: T Answer: T The statement vecList.push_back(elem) deletes the element elem from the vector. Answer:

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}; Answer: B Answer: B Answer: B The balance factor of x, written bf(x), is defined by ____. a. bf(x)= xl " x1 b. bf(x)= x1 " xh c. bf(x)= xh " x1 d.

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 d. bubble sort algorithm Answer: A Answer: A Answer: A The ____ operation checks whether the stack

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. Answer: T Answer: T Answer: T The front of the queue is accessed whenever a new element is added to the queue. Answer: F Answer: F Answer: F When analyzing

The first form of ____ uses the equality criteria. a. adjacent_search b. adjacent_query c. adjacent_find d. adjacent_criteria Answer: C Answer: C Answer: C In ____, the elements of the list are viewed as sublists at a particular distance. a. quicksort b. Shellsort c. bubble sort d. insertion sort Answer: B Answer: B Answer: B A recursive function in which the last statement executed is

____ 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 Answer: B Answer: B Answer: B In the STL container list, the function pop_front ____. a. inserts element at the beginning of the list b.

If the sequential search is unsuccessful, -1 is returned. Answer: T Answer: T Answer: T The performance of a binary search tree depends on the width of the tree. Answer: F Answer: F Answer: F Prior to the deleteQueue operation, the queue must exist and must not be full. Answer: F Answer: F Answer: F The class vector contains only one constructor. 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. Answer: F Answer: F Answer: F A sequential search works efficiently for large lists. Answer: F Answer: F Answer: F The function copyStack makes a copy of a stack. Answer: T Answer: T Answer: T The elements of

____ iterators, with write access, step forward element-by-element. a. Output b. Input c. Random access d. Step Answer: A Answer: A Answer: A A(n) ____ is a collection of a fixed number of components. a. object b. member c. class d. friend Answer: C Answer: C Answer: C The ability to combine data and operations is called ____. a. inheritance b. encapsulation c. redefinition d. composition Answer: B Answer: