1.1 Y2

I am a data structure that can map keys to values. I am

• an array

• a hash table

• a list

• a stack

In a hash table, a hash function carried out on the key field is used to compute the index where what can be found?

• The value or 'data'

• The memory address

• The data collision

In a hash table the value is placed into an array of

• 3D arrays

• lists or stacks

• buckets or slots

• 2D lists

2 keys, when 'hashed' produce the same hash code (index) this is called what?

Chaining

• A way of storing related data.

• A stack structure

• A way of handling collisions on a bus network

• A way of handling collisions when using a hash table.

When using a hash table to store data: if the resulting index is occupied use the next available location, when the end of the file is reached wrap around to the start.

This is a description of what?

When using a hash table, which of these is a disadvantage of using a separate overflow file.

• Searching takes longer as the data is now lost

• Searching the overflow area uses a linear search.

• takes up RAM

• adds to the stack

The processing order of a queue is?

• IFLO

• LIFO

• FIFO

• OLIF

The rear pointer of a queue data structure points to?

• The next available index

• The last item in the queue

• The first item in the queue

• A queue does not have a rear pointer.

Data can be removed from any place in a queue

• True

• False

Answer explanation

A queue is a limited data structure.

Data can only be added to the rear of a queue ad removed from the front.