Exam 12: Tables and Priority Queues

In an array-based implementation of the priority queue,where is the item with the highest priority value located?

In an array-based implementation of a heap,the heapInsert operation is ______.

In an array-based implementation of a heap,the number of array items that must be swapped to transform a semiheap of n nodes into a heap is ______.

In an array-based implementation of the priority queue,the pqDelete operation returns the item in ______.

In an unsorted array-based implementation of a table,a new item is inserted at location ______.

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

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

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

What function is performed by the tableLength operation of the ADT table?

The heapsort is ______ in the worst case.

The ADT table uses a search key to identify its items.

What are the two possible outcomes of the tableRetrieve operation of the ADT table?

Which of the following operations of the binary search tree implementation of the ADT tree is O(n)?

A binary search tree implementation of the ADT table is easier to understand than a linear implementation.

What is the major advantage that a heap implementation of a priority queue has over a binary search tree implementation?

An array based implementation of an ADT is a ______ implementation.

In a maxheap,the root contains a search key greater than or equal to the search key in each of its children.

Why is a binary search operation impractical for a reference-based implementation of the ADT table?

In an unsorted reference-based implementation of a table,the tableInsert operation requires a constant time regardless of the table size.

In the sorted linear implementation of a table,the proper position of a new item to be inserted is determined ______.