9. Hashing Intro

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 quase 8 anos atrás
18
0

Resumo de Recurso

Questão 1

Questão
What symbol is used to represent Load Factor and give the equation for determining Load Factor?
Responda
  • Alpha, (current number of hash items) / (table size)
  • none of the above

Questão 2

Questão
What is the hash function's (h(x)) functionality?
Responda
  • Maps the search key of an item to a location
  • none of the above

Questão 3

Questão
A good hash function places items ____ throughout the the hash table.
Responda
  • A) every other level
  • B) at every odd position
  • C) evenly
  • D) The hash function does not place items on the table.

Questão 4

Questão
What is hashing?
Responda
  • The use of a hash table to determine whether variables have been stored/accesed and allows for quicker searching.
  • none of the above

Questão 5

Questão
what is not good thing for hash function to have?
Responda
  • A.places items evenly throughtout the hash table
  • B.use a prime base
  • C,has no search key
  • D.none of the above

Questão 6

Questão
a Hash table is an array that contains items, assigned by a hash function
Responda
  • True
  • False

Questão 7

Questão
what is Hash table?
Responda
  • An array that contains items, assigned by a hash function.
  • none of the above

Questão 8

Questão
How do you determine the load factor of a hash table?
Responda
  • (current number of hash items)/(table size)
  • none of the above

Questão 9

Questão
Which of the following is not a requirement for a good hash function?
Responda
  • A) Fast (and easy) to compute
  • B) Places items evenly throughout the hash table
  • C) Involves the entire search key
  • D) Uses a non-prime base, if it uses modulo arithmetic

Questão 10

Questão
Which one is NOT a requirement for a good has function?
Responda
  • a. Fast and easy to compute
  • b. Involves entire search key
  • c. Use a prime base if it uses any arithmetic
  • d. Items placed evenly throughout the hash table

Questão 11

Questão
An array that contains items, assinged by a hash function is called
Responda
  • A. Hash function
  • B. Hash table
  • C. Hash Brown
  • D. None of the above

Questão 12

Questão
What is a hash table?
Responda
  • A) An array that contains items, assigned by a hash function.
  • B) A perfectly cooked pile of potatoes
  • C) A table of hash signs (#)
  • D) None of the above.

Questão 13

Questão
Which of the following is NOT a good requirement for a hash function?
Responda
  • A. Fast and easy to compute
  • B. O(nlogn) lookup time
  • C. places items evenly
  • D. involves the entire search key

Questão 14

Questão
What are the requirements for a good hash function?
Responda
  • A. fast and easy to compute
  • B. places items evenly throughout the hash table
  • C. involves the entire search key and uses a prime base, if it uses modular arithmetic
  • D. All of the above

Questão 15

Questão
Which of the following is a requirement for a good hash function?
Responda
  • A.Fast to compute
  • B.Places items randomly throughout the hash table
  • C.Involves parts of the search key
  • D.All of the above

Questão 16

Questão
Which statement is NOT true?
Responda
  • a. hash table : an array that contains items, assigned by a hash function
  • b. perfect hash function : maps each search key to a unique location
  • c. collision : occurs when the hash function maps 2+ items to the same location
  • d. collision : occurs when the hash function maps not 2+ items to the same location

Questão 17

Questão
What is the difference between a Perfect hash function and a Unifrom hash function?
Responda
  • A Perfect hash function maps each key to a unique location. While a Uniform hash function is equally likely to map a key to any index in the table.
  • none of the above

Semelhante

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