11. Hashing Eficiency

Descrição

Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
Mena Sargios
Quiz por Mena Sargios, atualizado more than 1 year ago
Mena Sargios
Criado por Mena Sargios mais de 7 anos atrás
9
0

Resumo de Recurso

Questão 1

Questão
What does the efficiency of a hash table search depend on?
Responda
  • Hashing efficiency for a particular search depends on whether the search is successful or not
  • none of the above

Questão 2

Questão
Find min and max values (Range Query) ______ be done in a hash table.
Responda
  • A) cannot
  • B) can
  • C) generally cannot
  • D) generally can

Questão 3

Questão
Which way is more efficient,linear or quadratic probing?
Responda
  • Quadratic
  • none of the above

Questão 4

Questão
what is the first thing you do when deleteing something from the hash?
Responda
  • A,find it
  • B.check to make sure its not holding a key
  • C. A and B
  • D.none of the above

Questão 5

Questão
to insert using open addressing, we need to find a closed location.
Responda
  • True
  • False

Questão 6

Questão
name of the of the hashing disadvantages
Responda
  • finding the item that has the smallest of largest search key.
  • none of the above

Questão 7

Questão
As the load factor increases, what happens to the number of unsuccessful searches in linear and quadratic probing?
Responda
  • A) They decrease
  • B) They increase rapidly
  • C) They linearly
  • D) They stay the same

Questão 8

Questão
Disadvantage of hash tables is that they are not a general purpose data structure for storage and retrieval.
Responda
  • True
  • False

Questão 9

Questão
What are the two steps in inserting into a hash insert?
Responda
  • 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

Questão 10

Questão
What is a disadvantage of hash tables?
Responda
  • 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

Questão 11

Questão
Which of the following is NOT a disadvantage of hash tables? (ie: which of the following are hash tables NOT bad at?)
Responda
  • A. traversing in sorterd order
  • B. finding the mininmum or maximum value in a search key
  • C. insertion is very inefficient
  • D. range query

Questão 12

Questão
Which of the following are disadvantages of hash tables?
Responda
  • 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

Questão 13

Questão
which of the following is a disadvantage of using a hash table?
Responda
  • 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

Questão 14

Questão
Hashing efficiency for a particular search also depends on whether the search is successful. Unsuccessful searches generally require more time than successful searches.
Responda
  • True
  • False

Questão 15

Questão
What is the efficency of insertion into a hash table?
Responda
  • O(1)!
  • none of the above

Semelhante

2. Red Black Tree
Mena Sargios
12. Graph Traversal
Mena Sargios
5. B-Tree
Mena Sargios
3. 2-3 Tree
Mena Sargios
7. Algorithm Growth Rate
Mena Sargios
16. Greedy Algorithm (Huffman code)
Mena Sargios
4. 2-3-4 Tree
Mena Sargios
1. Trees Splay Trees
Mena Sargios
10. Hashing Collision
Mena Sargios
14. Graph Shrtest Path
Mena Sargios
15. Graph Spanning Tree
Mena Sargios