Hash Tables & Other Data Structures

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

Address <----- key MOD(numberOfSlots)

IF KEY = 5432 and numberOfSlots = 1000

Address = ?

• 5

• 432

• 543

• 5432

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

• 
• 
• 
• 

What does the term immutable mean?

• unable to be changed

• unable to speak

• can be modified

• can be increased in size

Which data structure cannot have elements of different data types?

• Array

• Tuple

• Record

• Stack

• Queue

In terms of data structures, what does mutable mean?

• A mutable structure is one which can only have data added to it

• A mutable structure is one which is fixed in size

• A mutable structure is one which allows data to be added, edited, deleted or moved

What type of data structure is an array?

• Static and mutable

• Dynamic and immutable

• Static and immutable