Monads: Data Structures with Laws

Related lectures (49)

Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.

Covers in-place tokenization in C, focusing on modifying strings directly to extract tokens.

Covers Boolean algebra properties, optimization techniques, and the importance of valid groups in Karnaugh maps.

Discusses data representation through models and systems, covering mathematical models, data structures, levels of modeling, and managing data.

Explains the differences between mutable and immutable objects in Python, focusing on lists, sets, and their behaviors.

Covers tensor algebras, symmetric and exterior algebras, and tensor products of modules.

Covers Advanced Quantum Field Theory with a focus on spinors, wave functions, rotations, and constraints.

Provides a detailed review of the 2016 final exam, covering various algorithmic problems.

Explains dynamic memory allocation in C, focusing on the realloc function and its implications for managing memory effectively.

Page 3 of 3