Data Structures Revision

If a list of items is in random order, use a:

• Binary search

• Linear search

Hashing gives each item

• A sequential address

• A logarithmic address

• No address

• A unique address

A hash table is

• an abstract data structure

• an array

• an integer

• made of pine

When an algorithm generates the same address for different primary keys, it is known as:

• Knock

• Bang

• Collisions

• DoubleHash

What is the status after adding 10

• 
• 
• 
• 

What is the status after adding 7

• 
• 
• 
• 

An ADT gives you specific details on how it will run within a particular algorithm.

• True

• False

Select all correct descriptions of an ADT

• Logical Description

• How we view the data

• What possible operations it can perform

• How it will behave

• How it will be implemented

What are you aiming to avoid when creating a suitable method for dealing with collisions in a hash table?

• Clustering

• Merging

• Cluttering

The goal of hashing is to produce a search that takes

• O(1) time

• O(n^2) time

• O(log n) time

• O(n log n) time