Question 1

What are the advantages of a linear implementation of the ADT table over a binary search tree implementation?

Accepted Answer

The main advantages of a linea

Question 2

What are the two main differences between a heap and a binary search tree?

Accepted Answer

First,while a binary search tree can be

Question 3

Heapsort is a sorting algorithm that uses the heap data structure.Discuss how we can use a binary search tree to sort a list of values.Why would such an algorithm not perform as efficiently as heapsort?

Accepted Answer

First,enter the values into an empty bin

Question 4

A heap is a ______.

Accepted Answer

A) general tree 
B) table 
C) full binary tree 
D) complete binary tree 
A) general tree 
B) table 
C) full binary tree 
D) complete binary tree

Question 5

The search key of an item must not change for as long as the item is stored in a table.

Accepted Answer

A) True 
 B)False

Question 6

The Java Collections Framework includes classes called maps such as HashMap and TreeMap.In such classes,the individual elements each have two attributes.What are they?

Accepted Answer

a key and

Question 7

A sorted implementation of a table can insert a new item into any convenient location.

Accepted Answer

A) True 
 B)False

Question 8

How does the pqDelete operation work in a linear implementation of the priority queue based on a linked list?

Accepted Answer

The pqDelete operation returns

Question 9

A(n)______ implementation of a table is nonlinear.

Accepted Answer

A) list 
B) linked list 
C) binary search tree 
D) array 
A) list 
B) linked list 
C) binary search tree 
D) array

Question 10

The ADT table is also known as a ______.

Accepted Answer

A) map 
B) queue 
C) heap 
D) dictionary 
A) map 
B) queue 
C) heap 
D) dictionary

Question 11

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

Accepted Answer

A) O(1) 
B) O(n) 
C) O(n²) 
D) O(log n) 
A) O(1) 
B) O(n) 
C) O(n²) 
D) O(log n)

Question 12

In a binary search tree implementation of the ADT table,the item with the highest priority value is always in the ______.

Accepted Answer

A) root of the tree 
B) leftmost node of the tree 
C) rightmost node of the tree 
D) leftmost node at level 1 of the tree 
A) root of the tree 
B) leftmost node of the tree 
C) rightmost node of the tree 
D) leftmost node at level 1 of the tree

Question 13

The ADT table is position-oriented.

Accepted Answer

A) True 
 B)False

Question 14

In a heap,the search keys of the children of a particular node have no relationship.

Accepted Answer

A) True 
 B)False

Question 15

What is a semiheap?

Accepted Answer

A semiheap is a comp

Question 16

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

Accepted Answer

A) minheap 
B) maxheap 
C) complete heap 
D) binary heap 
A) minheap 
B) maxheap 
C) complete heap 
D) binary heap

Question 17

The heapsort is ______ in the average case.

Accepted Answer

A) O(1) 
B) O(n) 
C) O(log n) 
D) O(n * log n) 
A) O(1) 
B) O(n) 
C) O(log n) 
D) O(n * log n)

Question 18

What does the priority value in a priority queue correspond to in a heap?

Accepted Answer

The priority value i

Question 19

In the Java Collections Framework,what is the difference between a Collection and a Set?

Accepted Answer

In a set,duplicate elements ar

Question 20

What are the four categories of linear implementations of tables?

Accepted Answer

The four categories are:
-unso

What are the advantages of a linear implementation of the ADT table over a binary search tree implementation?

What are the two main differences between a heap and a binary search tree?

Heapsort is a sorting algorithm that uses the heap data structure.Discuss how we can use a binary search tree to sort a list of values.Why would such an algorithm not perform as efficiently as heapsort?

A heap is a ______.

The search key of an item must not change for as long as the item is stored in a table.

The Java Collections Framework includes classes called maps such as HashMap and TreeMap.In such classes,the individual elements each have two attributes.What are they?

A sorted implementation of a table can insert a new item into any convenient location.

How does the pqDelete operation work in a linear implementation of the priority queue based on a linked list?

A(n)______ implementation of a table is nonlinear.

The ADT table is also known as a ______.

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

In a binary search tree implementation of the ADT table,the item with the highest priority value is always in the ______.

The ADT table is position-oriented.

In a heap,the search keys of the children of a particular node have no relationship.

What is a semiheap?

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

The heapsort is ______ in the average case.

What does the priority value in a priority queue correspond to in a heap?

In the Java Collections Framework,what is the difference between a Collection and a Set?

What are the four categories of linear implementations of tables?

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Advanced Implementations of Tables

Graphs

External Methods

Filters

Exam 12: Tables and Priority Queues

What are the advantages of a linear implementation of the ADT table over a binary search tree implementation?

What are the two main differences between a heap and a binary search tree?

Heapsort is a sorting algorithm that uses the heap data structure.Discuss how we can use a binary search tree to sort a list of values.Why would such an algorithm not perform as efficiently as heapsort?

A heap is a ______.

The search key of an item must not change for as long as the item is stored in a table.

The Java Collections Framework includes classes called maps such as HashMap and TreeMap.In such classes,the individual elements each have two attributes.What are they?

A sorted implementation of a table can insert a new item into any convenient location.

How does the pqDelete operation work in a linear implementation of the priority queue based on a linked list?

A(n)______ implementation of a table is nonlinear.

The ADT table is also known as a ______.

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

In a binary search tree implementation of the ADT table,the item with the highest priority value is always in the ______.

The ADT table is position-oriented.

In a heap,the search keys of the children of a particular node have no relationship.

What is a semiheap?

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

The heapsort is ______ in the average case.

What does the priority value in a priority queue correspond to in a heap?

In the Java Collections Framework,what is the difference between a Collection and a Set?

What are the four categories of linear implementations of tables?

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Advanced Implementations of Tables

Graphs

External Methods

Filters