171k views
2 votes
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?

a. 3
b. 4
c. 2
d. 1

1 Answer

6 votes

Answer:

The answer is "Option C".

Step-by-step explanation:

Dictionary is a set of unsorted data values, that is used to save data like a map and which contains a key: value pair in comparison to many other types of data, which only carry a specific number as just an element.

If we use Dictionary as an array so, it uses a two-pointer variable, one for hold key, and the second is used to hold its value.

Related questions

asked Feb 17, 2024 218k views
Pravanjan asked Feb 17, 2024
by Pravanjan
8.6k points
1 answer
4 votes
218k views
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.