Objectives¶
Upon completion of this section, each student will be able to:
accurately and precisely describe the concepts present in the chapter of the reference book, which deals with hash tables and tries
implement algorithms based on hash tables
implement algorithms based on tries
design appropriate hash functions for different types of objects
solve simple problems on storing and accessing information in hash tables
evaluate and implement classical representations of hash tables
describe and accurately implement the Rabin-Karp algorithm for searching a text in a corpus.
describe and implement bitsets (not covered in the book)
