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

You are designing a spell-checker application that uses a hash table to store a large dictionary of words. Which collision-resolution technique would you choose for this application, and why?a)Linear probing, for its simplicity and ease of implementation.b)Separate chaining, for its ability to handle a large number of words efficiently.c)Quadratic probing, for its deterministic probing sequence.

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 are sorted data structures.They guarantee constant time operations for all operations.

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

Which of the following data structures can be efficiently implemented using Double Hashing?OptionsHash tablesLinked listsArraysBinary trees

Which data structure is known for its efficient time complexity but often consumes a lot of memory space?ALinked ListBHash TableCStackDBinary Search TreeSubmit Answer