Exam 12: Tables and Priority Queues

In an unsorted array-based implementation of the ADT table,the insertion operation is ______.

Which of the following is true about a linear implementation of a table?

A semiheap is a ______.

In a linear implementation of the priority queue based on a linked list,the item with the highest priority value is located ______.

The sorted array-based implementation of the tableInsert operation is ______.

For what kinds of situations is a linear implementation of the ADT table more efficient than a binary search tree implementation?

The mergesort is more efficient than the heapsort in the worst case.

When implementing an ADT such as a table,one design question is how often each ADT operation is to be performed.Why do we ask ourselves this question?

The first item to be removed from a priority queue is the item ______.

What is a linear implementation?

Which of the following is true about the heapsort?

A binary search tree implementation of a table is a linear implementation.

If the item with a given search key does not exist in a table,the tableRetrieve operation returns ______.

The ______ operation of the ADT table throws a TableException.

The sorted reference-based implementation of the tableDelete operation is ______.

A priority queue orders its items by their ______.

A heap in which the root contains the item with the smallest search key is called a ______.

What kind of implementation of the ADT table is appropriate for retrieval-dominated applications if the maximum size of the table is NOT known?

What is the effect of the assumption that all items in a table have distinct search keys,on the insertion operation of a table?

In an array-based implementation of a heap,the parent of the node in items[i] is always stored in ______.