Question

Provide an explanation of hashtables, including a description of a realistic scenario that could be solved with the application of a hashtable. Then, compare the purpose and usage of hashtables to JTrees as well as one of the following additional data structures: Arraylist, array, or JList. In your comparison, be sure to include an explanation of one way hashtables are similar to your selected data structure and one way in which they are different. please gives examples

Answer 1

Hashtable :It uses functions called as hash function to calculate the index of key value into an array of buckets.

The idea behind hashing is to distribute the enteries to given keys in an array.

We can find the application of hashing :

example:PASSWORD VERIFICATION

Whenever a password is entered by an user in any software.the entered password is hashed and then it sends it to the sever for validation or verification.passwords in server are in hash values of original one.

It ensures the correctness of password entered by user.

comparison with jtrees:

purpose of Jtree and hashtable->JTree is uesd to display elements through tree data structure ,hence it is a complex component .It has a root (parent of all node).

hashtable shows the elements in key-value pair which are computed using hash functions in an array .

usage of jtrees and hash table:

jtree->It is a swing data structure to present elements in tree -structured form.

hashtable->It computes the index position of key in table using some calculations.

comparison with array-list and hashtable:

similarity->A hash table is like arrayy list data structure which is used to store element.

difference->an array is an ordered list of elements where hash is collection of key/value pairs.