NEW
Font size
WorksheetsData Structures: Linked Lists and Hashtables
Total questions: 14
Worksheet time: 9mins
What advantage does a linked list have over an array?
Size of the list doesn't need to be specified at the beginning of the program
You can add or remove elements from the middle of the list.
The linked list doesn't have a size limit
All of these are true.
Nodes in a linked list contain two things
Direction and a pointer
Data and a pointer
Pointer and a link
A pointer and a node
Hashing gives each item
A sequential address
A logarithmic address
No address
A unique address
address = key MOD(numberOfSlots)
If key = 5432 and numberOfSlots = 1000
address = ?
5
432
543
5432
when a hashing algorithm generates the same address for different keys it is known as
Knock
Bang
Collision
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
Which word means storing data in sequence in memory, next to each other?
contiguous
contrary
quantitative
immutable
A hashing algorithm divides the item into equal parts, and then adds the parts to give the hash value. E.g. 0203456789 would become 02+03+45+67+89= 206.
This method is know as what?
Rehashing method
Folding method
Clustering method
Enqueue method
Rehashing is..
using ASCII codes to generate the hash value
creating a new hash table
the process of finding an empty slot when a collision has occurred
shuffling the items in a hash table
