Elementary Data Structures: Stacks, Queues, Linked Lists

Related lectures (22)

Page 2 of 3

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

Covers optimal purely functional priority queues, Scala implementation, Stainless integration, operations properties, and binomial queues.

Explains pointer arithmetic in C, focusing on memory manipulation and common pitfalls.

Discusses data abstraction in programming, focusing on modules and specifications in Coq.

Explores C++ standard library containers and algorithms, including associative tables, stacks, queues, and random number generation.

Introduces Python programming concepts, focusing on lists, functions, and their applications in problem-solving.

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

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

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

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