Mena Sargios
Quiz by , created more than 1 year ago

Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU

9
0
0
Mena Sargios
Created by Mena Sargios over 7 years ago
Close

11. Hashing Eficiency

Question 1 of 15

1

What does the efficiency of a hash table search depend on?

Select one of the following:

  • Hashing efficiency for a particular search depends on whether the search is successful or not

  • none of the above

Explanation

Question 2 of 15

1

Find min and max values (Range Query) ______ be done in a hash table.

Select one of the following:

  • A) cannot

  • B) can

  • C) generally cannot

  • D) generally can

Explanation

Question 3 of 15

1

Which way is more efficient,linear or quadratic probing?

Select one of the following:

  • Quadratic

  • none of the above

Explanation

Question 4 of 15

1

what is the first thing you do when deleteing something from the hash?

Select one of the following:

  • A,find it

  • B.check to make sure its not holding a key

  • C. A and B

  • D.none of the above

Explanation

Question 5 of 15

1

to insert using open addressing, we need to find a closed location.

Select one of the following:

  • True
  • False

Explanation

Question 6 of 15

1

name of the of the hashing disadvantages

Select one of the following:

  • finding the item that has the smallest of largest search key.

  • none of the above

Explanation

Question 7 of 15

1

As the load factor increases, what happens to the number of unsuccessful searches
in linear and quadratic probing?

Select one of the following:

  • A) They decrease

  • B) They increase rapidly

  • C) They linearly

  • D) They stay the same

Explanation

Question 8 of 15

1

Disadvantage of hash tables is that they are not a general purpose data structure for storage and retrieval.

Select one of the following:

  • True
  • False

Explanation

Question 9 of 15

1

What are the two steps in inserting into a hash insert?

Select one of the following:

  • A. Hash the key, insert the item

  • B. Insert the item, hash the key

  • C. Hash the item, insert the key

  • D. Insert the key, remove the item

Explanation

Question 10 of 15

1

What is a disadvantage of hash tables?

Select one of the following:

  • A) Not a general purpose storage/retrieval data structure

  • B) It is not stable

  • C) It is not efficient

  • D) All of the above

  • E) None of the above

Explanation

Question 11 of 15

1

Which of the following is NOT a disadvantage of hash tables? (ie: which of the following are hash tables NOT bad at?)

Select one of the following:

  • A. traversing in sorterd order

  • B. finding the mininmum or maximum value in a search key

  • C. insertion is very inefficient

  • D. range query

Explanation

Question 12 of 15

1

Which of the following are disadvantages of hash tables?

Select one of the following:

  • A. traversal in sorted order

  • B. finding the item that has the smallest or largest search key

  • C. range query

  • D. all of the above

Explanation

Question 13 of 15

1

which of the following is a disadvantage of using a hash table?

Select one of the following:

  • A. Traversal in sorted order

  • B. Finding the item that has the smallest or largest search key

  • C. Range Query

  • D. All of the above

  • E. A and C

Explanation

Question 14 of 15

1

Hashing efficiency for a particular search also depends on whether the search is successful.
Unsuccessful searches generally require more time than successful searches.

Select one of the following:

  • True
  • False

Explanation

Question 15 of 15

1

What is the efficency of insertion into a hash table?

Select one of the following:

  • O(1)!

  • none of the above

Explanation

Previous
Check answer
Next