Which of the following is true about hash tables?Group of answer choicesThey are not suitable for implementing dictionaries or associative arrays.They are efficient for searching, insertion, and deletion.They guarantee constant time operations for all operations.They are sorted data structures

A hash table is an array-based data structure Group of answer choicesTrueFalse

A hash table is always faster than a binary search tree for searching elements.Group of answer choicesTrueFalse

What is the advantage of a hash table as a data structure?a.easy to implementb.exhibit good locality of referencec.very efficient for less number of entriesd. faster access of data

You are designing a spell-checking system for a word processing application. You need to efficiently store and retrieve a large dictionary of words with their associated data. Which data structure would you choose, and why?a)A symbol table implemented as a hash table, because it provides fast lookups for a large dataset.b)An array, because it allows for constant-time lookups.c)A linked list, because it can efficiently manage collisions.d)A binary search tree, because it ensures data is sorted alphabetically

What is the primary purpose of a hash function in data structures?Group of answer choicesTo generate a unique key for a given inputTo reduce the size of dataTo divide data into fixed-size blocksTo sort the data