Question

Language is Java

Question 5 10 pts In an array-based implementation of a dictionary, using one array to store the search keys and a separate array to store the corresponding values is called parallel arrays concurrent arrays corresponding arrays duplicate arrays Question 6 10 pts In an array based implementation of a dictionary, you can store key value pairs in parallel arrays encapsulated in an object both aand b none of the above Question 7 10 pts In an array based implementation of a dictionary, if you represent the entries as an array of objects that encapsulate each search key and corresponding value, how many pointers will you use per array entry? 1

Answer 1

5)

a)

parallel arrays

6)

c)

both a and b

7)

b)

2