Searching

Question 1

What is a hash table?

Answer 1

Data structure that lets us find stored values more efficiently than sequential search O(n) or binary search O(log n) if using indices instead of slicing, which is O(n)

Question 2

What’s a slot in a hash table?

How is it named and what does it hold?

Answer 2

each position of a hash table, named by an integer value (starting at 0) - indices of the list
holds an item

Question 3

What maps an item with the slot it’ll be in in the hash table?

Answer 3

Hash function

Question 4

What is the load factor?

Answer 4

number of items in table / number of slots in the table

Question 5

Name 2 methods for a hash function

Answer 5

Remainder method

Folding method

Question 6

Name 2 main collision resolution tactics

Answer 6

Open Addressing

Chaining