Finite Automata: BasicsIntroduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
Relations in Computer ScienceExplores the properties of relations in computer science, including equivalence relations and the partition of a set.
Huffman CodingExplores Huffman coding by comparing it to organizing a kitchen for efficiency.
CompressionCovers the concept of compression and constructing prefix-free codes based on given information.
Clustering: k-meansExplains k-means clustering, assigning data points to clusters based on proximity and minimizing squared distances within clusters.
