Lectures related to Persistent data structure

Covers functional data structures and their relationships, implementations, and efficiency.

Covers the representation of mathematical models, functions, and data structures in information systems.

Explores constant time appends in Conc-Trees and counting in a binary number system.

Explores parallel programming in Scala, functional operations on collections, and parallel map functions on arrays and trees.

Explores the verification of programs using Stainless, focusing on functional correctness, proof assistants, and automation of reasoning tasks.

Covers list construction, methods, and implementations, including exercises and complexity analysis.

Explores eventual consistency, actors in Scala, and the importance of suitable data structures for achieving consistency in distributed systems.

Explores functions' complements, parameter order, and list manipulation, including counting occurrences and solving the '100 prisoners problem'.

Covers advanced Python programming concepts, including data structures and functions.

Explores tuples, sets, and dictionaries in Python, covering immutability, uniqueness, and key-value pairs.

Covers the implementation of Conc-Trees in Scala for parallel programming.

Covers the introduction to arrays in C++, including their use, limitations, and solutions.

Covers Python list manipulation and comprehension, emphasizing memory representation and mutability.

Introduces data structures like tuples, lists, sets, and dicts in Python, covering their definition, manipulation, and iteration.

Covers the principles of classes, encapsulation, and modular programming in C++.

Explores dictionaries, tuples, mutable objects, and variable-length arguments in Python.

Covers fundamental programming concepts such as algorithms, variables, and expressions in C++.

Covers the concepts and implementation of functional programming in Scala, emphasizing functions, immutable data, and data abstraction.

Covers the analysis of static (rigid) structures, including equilibrium and free-body diagrams.

Introduces RDMA and Persistent Memory, discussing their features, challenges, and impact on concurrent algorithms.