Lectures related to Two-Phase Construction: Arrays & Hash Tables

Explores the analysis of running time in hash tables, covering successful searches, key distribution, and table size impact.

Explores hash tables through the Birthday Paradox, collisions, and implementation methods.

Introduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.

Explains binary search tree operations, focusing on insertion, search, and list conversion, with an emphasis on formal verification and debugging.

Covers the basics of parallelism, including physical examples, historical context, multicore era, and parallel collections in Scala.

Covers state space models and the expressivity of transformers in sequence copying tasks.