hash tables quiz

What is the time complexity for a successful search in a well-structured hash table with no collisions?

• O(1) - Constant time.

• O(log n) - Logarithmic time.

• O(n) - Linear time.

In a hash table, what is an ideal hash function like?

• It should produce hash codes in a predictable, sequential order.

• It should minimize collisions and evenly distribute keys across buckets.

• It should rely on the key's length to generate hash codes.

What is the primary advantage of using BFS in maze solving?

• It guarantees the shortest path to the exit.

• It requires less memory than DFS.

• It always explores the rightmost path first.

Breadth-First Search (BFS) explores nodes layer by layer and uses a ............... data structure to keep track of nodes to visit.

• Stack

• Queue

• linked list

A key requirement for a good hash function is to minimize -------- and evenly distribute keys across slots.

In Breadth-First Search (BFS), if you want to find the shortest path between two nodes in a weighted graph, what additional information is required?

• The number of nodes in the graph.

• The edge weights between nodes.

• The maximum depth of the graph.

In the context of hash tables, what is the purpose of a hash function?

• To create a random order of keys in the table.

• To determine the order in which keys are inserted.

• To convert a key into an array index