Unlock document.
This document is partially blurred.
Unlock all pages and 1 million more documents.
Get Access
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 "is a" retriever.
d. The relationship between these classes implies that retriever "has-a" dog.
In the worst case, the height of an AVL tree with n nodes is approximately ____.
a. (1.44)logn
b. (1.44)nlogn
c. (1.44)log2n
d. (1.44)logn2
The ____ algorithm tries to extend a partial solution toward completion.
a. backordering
b. tracing
c. backtracking
d. recursive
The general syntax to use an istream iterator is ____.
a. istream_iterator<Type> isIdentifier(*istream);
b. istream_iterator<Type> isIdentifier(istream&);
c. istream_iterator isIdentifier(istream&);
d. istream_iterator isIdentifier(istream&<Type>);
To implement the deleteQueue operation, we access the index ____.
a. queueBack
b. queueFront
c. queueTail
d. queueCurrent
A ____ is a set of elements of the same type in which the elements are added at one
end.
a. hash table
b. tree
c. queue
d. network
To delete a node, we adjust one of the pointers of the ____.
a. leaf node
b. parent node
c. branch node
d. child node
Quicksort first selects an element in the list, called the ____, and then partitions the list
so that the elements in one sublist are less than pivot.
a. primate
b. key
c. pivot
d. index
A recursive function is ____ a corresponding iterative function in terms of execution
time and memory usage.
a. more efficient than
b. proportional to
c. similar to
d. less efficient than
In a(n) ____ copy, two or more pointers of the same type point to the same memory.
a. indirect
b. direct
c. deep
d. shallow
In a linked list, we always want head to point to the ____ node.
a. key
b. main
c. first
d. last
Every object in a sequence container has a specific position.
The linked implementation of a queue is similar to the implementation of a linked list
created in a backward manner.
Indirect recursion requires the same careful analysis as direct recursion.
Each node should store the number of keys in the node, the records, and the pointer to
subtrees.
Adding, or pushing, an element onto the stack is a two-step process.
An iterator of type const_reverse_iterator is used to iterate through the elements of a
container in reverse.
The time complexity of the function seqSearch in an array list is O(n2).
The postfix expression 2 3 + 1 * = evaluates to 8.
Quadratic probing reduces primary clustering and probes all the positions in the table.
The queue is empty if queueFront is NULL.
The elements at the top of the stack have been in the stack the longest.
The postfix expression 6 3 + 2 * = evaluates to 18.
In a doubly linked list, every node contains the address of the next node (except the last
node), and every node contains the address of the previous node (except the first node).
When deleting from a B-tree, if the leaf contains only the minimum number of keys,
look at the sibling nodes that are adjacent to the leaf.
The address of the first node in a linked list is stored in a separate location, called the
head.
Encapsulation is the ability to create new data types from existing data types.
To successfully implement a stack, we need at least seven operations.
A stack is called a LIFO data structure.
A tree T is called a spanning tree of graph G if T is a subgraph of G such that V(T) =
V(G), that is, all the vertices of G are in T.
