Hash Functions and TablesIntroduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.
Hash Tables AnalysisCovers the analysis of hash tables, including search operations and expected collisions.
Lexicons, n-grams and Language ModelsExplores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.
Hashing and SortingCovers hashing, sorting, extendible hashing, linear hashing, and external sorting.
Cryptographic Security FundamentalsCovers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.
Total Functions: How and WhyExplores hash table efficiency, total functions in code modeling, and well-founded relations for recursive function termination.
Implementation of Sets (II)Covers the implementation of sets using a naive approach and discusses the inefficiencies of the S list 7 class.
