Select one behavior. Every returned turn has one binary label: Present or Absent. Source: final dense boolean release.
f46c916ced31482834a55af4Which of the following is the tightest bound for the worst-case of delete(el) on a binary search tree with n nodes, including searching for el a. O(n3) b. O(1) c. O(n) d. O(lg n) e. O(n lg n) f. O(n2)
d. O(lg n)
cdffc8baffc10a25e298c868Which of the following is the tightest bound for the worst-case of heapSort(n) on an array with n values? a. O(n3) b. O(n2) c. O(n) d. O(n lg n) e. O(lg n) f. O(1)
d. O(n lg n)
bc48ceb13d584955688b279bWhich data structure is most space efficient to represent k-ary trees for large k? a. Store the keys in an array according to their breadth-first traversal visit ordering b. Each parent points to its first child and its children form a linked list c. all of the other choices are as efficient as each other d. Nodes have a fixed number of children pointers equal to the maximum degree of the tree
b. Each parent points to its first child and its children form a linked list
cca06d14f24f2bdaebeea06btrue or false. The number of non-zero entries in the adjacency matrix representation of an undirected graph is even. a. True b. False
a. True
454550c94039788c9bb61fcbA collection of vertices and edges that connect pairs of vertices. a. Graph b. Tree c. Hash Table d. Linked List
a. Graph
dbe75bd0cc7fd165301f08c9true or false. In graphs, if all edges incident on a vertex are to be sequentially processed, an adjacency list representation often performs faster than an adjacency matrix representation. a. True b. False
a. True
5ea33814da4e5d12b7c96177Performed by Depth-First search when all adjacent vertices have all been visited a. Backtracking b. Divide-and-Conquer c. Collision Resolution d. Rotation
a. Backtracking
d8497ef470e92d218b78825cTo compute shortest paths from a start vertex, what are the best adjacency matrix entries for pairs of non-adjacent vertices? a. 0 b. 1 c. -∞ d. ∞
d. ∞
667506176a3324811c92cc92true or false. Depth First Search of a graph uses a queue. a. True b. False
b. False
56b5f430098d30cdf985f596The number of edges in a graph with n vertices is a. O(lg n) b. O(n) c. O(n2) d. O(1) e. O(n lg n)
The number of edges can vary between graphs, but at most a complete graph of n vertices will have n*(n-1)/2 edges. Therefore, the tightest bound for the number of edges in a graph with n vertices is O(n2). So, the answer is c. O(n2).