Associative Array (Module 7)

Question 1

What is a fundamental concept in computer science used for efficiently storing and retrieving data

Answer 1

hashing

Question 2

How does hashing work?

Answer 2

mapping data to a hash code using a hash function

Question 3

Which type of an array is an ADT that stores key-value pair?

Answer 3

associative array

Question 4

For an associative array, each key is _____ and associated with a ______.

Answer 4

unique, value

Question 5

For an associative array, what does a key allow you to do?

Answer 5

retrieve or update a value

Question 6

Which field represents the unique identifier?

Answer 6

Key

Question 7

Which field represents the associated data for the key?

Answer 7

Value

Question 8

To insert, search or delete, which two search algorithms are used to locate the right key in the associative array?

Answer 8

linear search and binary search

Question 9

Which search algorithm is best for an associative array sorted by key for faster lookups?

Answer 9

binary search

Question 10

Which search algorithm is slow for large associative arrays if the array isn’t sorted?

Answer 10

linear search

Question 11

Why is linear search and binary search inefficient for large datasets?

Answer 11

searches, insertions, and deletions can be slow