HomeworkLib
Question

Hash tables are very useful in certain situations but they are not necessary in other situations....

Hash tables are very useful in certain situations but they are not necessary in other situations.

Discuss when you think a hash table should be used and when you think it should it be avoided.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Hash Table is a data structure that can map keys to values.Hash table is better than search trees or any other lookup structure.Hash table is mainly used in computer software as well as database indexing.It is generally used to implement associative arrays and dynamic resizing.Speed is one of the main advantage of Hash table.
Example : Pair Sum Problem, Sum of Functions Problem
Hash table is not used where we are not storing values at keys.The hash tables are not effective when the number of entries is very small,in that case we prefer array over hash tables.

0 0
Add a comment
Know the answer?
Add Answer to:
Hash tables are very useful in certain situations but they are not necessary in other situations....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • In general, how useful is the Dictionary/Hash Table data structure? Can you think of other uses...

    In general, how useful is the Dictionary/Hash Table data structure? Can you think of other uses aside from those? If we didn’t have the Dictionary/Hash Table data structure can you think of another way to implement the dictionary concept? Can the Dictionary/Hash Table ADT accept/handle null key entries? What about null values? Why or why not? Given these behaviors, what conclusions can you draw about tuning a hash table for different data sets?

  • Dynamic perfect hash tables and cuckoo hash tables are two different data structures that support worst-case...

    Dynamic perfect hash tables and cuckoo hash tables are two different data structures that support worst-case O(1) lookups and expected O(1)-time insertions and deletions. Both require O(n) auxiliary space and access to families of hash functions for their operations. I think that both of these data structures are beautiful and brilliant in their own right, but I'm not sure I see how and when one of these would be preferable over the other. Are there specific contexts in which one...

  • Tables of data used to be very popular. Why do you think tables as a means...

    Tables of data used to be very popular. Why do you think tables as a means of storage and communicating standard data is less popular today? When would a table be an advantage over more advanced methods?

  • What other types of situations can you think of in which resiliency is necessary for a...

    What other types of situations can you think of in which resiliency is necessary for a child or adult to experience a positive outcome?

  • Cryptographic hash functions are very commonly used in password verification. For example, when you use any...

    Cryptographic hash functions are very commonly used in password verification. For example, when you use any online website which requires a user login, you enter your E-mail and password to authenticate that the account you are trying to use belongs to you. When the password is entered, a hash of the password is computed which is then sent to the server for verification of the password. The passwords stored on the server are actually computed hash values of the original...

  • Hash Tables. (Hint: Diagrams might be helpful for parts a) and b). ) When inserting into...

    Hash Tables. (Hint: Diagrams might be helpful for parts a) and b). ) When inserting into hash table we insert at an index calculated by the key modulo the array size, what would happen if we instead did key mod (array_size*2), or key mod (array_size/2)? (Describe both cases). Theory answer Here Change your hashtable from the labs/assignments to be an array of linkedlists – so now insertion is done into a linkedlist at that index. Implement insertion and search. This...

  • C++ assignment - Hash table with linear probing --- implement in single file - main.cpp You...

    C++ assignment - Hash table with linear probing --- implement in single file - main.cpp You are asked to implement a very specific hash table. The keys are lower-case English words (e.g., apple, pear). The length of a key is at most 10. The hash function is “simply using the last character”. That is, the hash value of apple should be e, and the hash value of pear should be r. Your hash table contains exactly 26 slots (hash value...

  • think of some other "defined situations" for which unit standards of care might be useful. think...

    think of some other "defined situations" for which unit standards of care might be useful. think like a nurse suggest some other subgroups for which a protocol might be appropriate. fundamentals of nursing chapter 5 Knowledge Check 5-2 edition to care related to the patient's ces of information does a comprehensive care plan ents basic needs, what other types of informa contain? How are critical pathways different from ent from other standardized the main disadvantage of computerized and care plans?...

  • This can be a very difficult issue for many people. Please discuss your reactions to the...

    This can be a very difficult issue for many people. Please discuss your reactions to the material presented this week. What do you believe is the best way to help someone involved in Domestic Violence and what do you think should be avoided. Please be sure to include some information from the readings and other material presented this week to back up your opinion.

  • PROGRAM DESCRIPTION Implement a hash table class. Your hash table should resolve collisions by chaining and...

    PROGRAM DESCRIPTION Implement a hash table class. Your hash table should resolve collisions by chaining and use the multiplication method to generate hash keys. You may use your own linked list code from a previous assignment or you can use a standard sequence container. Partial definitions for the hash table class and a generic data class are provided (C++ and Java versions). You may use them as a starting point if you wish. If you choose to design your own...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT