Lecture

Data Structures: Tuples, Lists, Sets, Dicts

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

ENG-209: Data science for engineers with Python

Ce cours propose une immersion progressive et complète dans le domaine de la Data Science à travers le langage Python. Il guide les étudiants depuis la manipulation de données brutes jusqu'à la modélisation et l'extraction de connaissances utiles à partir ...

Description

This lecture covers the fundamentals of data structures in Python, including tuples, lists, sets, and dictionaries. It explains how to define, manipulate, and iterate through these structures, as well as conversions between them. Additionally, it introduces dataclasses for flexible data representation.

Instructors (2)

Olivier Verscheure

SWISS DATA SCIENCE CENTER Housed at both EPFL and ETH Zurich, the newly created Swiss Data Science Center (SDSC) will address the fragmentation within today's data and analytics landscapes. The SDSC will be composed of a distributed multi-disciplinary team of data scientists and experts in domains including personalized health and personalized medicine, transportation, earth and environmental science, social science and digital humanities, and economics. The center aims to federate data providers, data and

Jean-Philippe Pellet

Teaching & PhD Courses Data science for engineers with Python ENG-209 This course offers a gradual and comprehensive introduction to the field of Data Science through the Python programming language. It guides students from raw data manipulation to modeling and the extraction of meaningful insights from real-world data.

Official source

Ontological neighbourhood

Mathematics

Mathematical logic: Set theory

Related concepts (32)

Passive data structure

In computer science and object-oriented programming, a passive data structure (PDS), also termed a plain old data structure or plain old data (POD), is a record, in contrast with objects. It is a data structure that is represented only as passive collections of field values (instance variables), without using object-oriented features. Passive data structures are appropriate when there is a part of a system where it should be clearly indicated that the detailed logic for data manipulation and integrity are elsewhere.

Data structure

In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data. Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure implements the physical form of the data type.

Family of sets

In set theory and related branches of mathematics, a collection of subsets of a given set is called a family of subsets of , or a family of sets over More generally, a collection of any sets whatsoever is called a family of sets, set family, or a set system. A family of sets may be defined as a function from a set , known as the index set, to , in which case the sets of the family are indexed by members of .

Disjoint sets

In mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets, while {1, 2, 3} and {3, 4, 5} are not disjoint. A collection of two or more sets is called disjoint if any two distinct sets of the collection are disjoint. This definition of disjoint sets can be extended to families of sets and to indexed families of sets.

Persistent data structure

In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when it is modified. Such data structures are effectively immutable, as their operations do not (visibly) update the structure in-place, but instead always yield a new updated structure. The term was introduced in Driscoll, Sarnak, Sleator, and Tarjans' 1986 article. A data structure is partially persistent if all versions can be accessed but only the newest version can be modified.

Related lectures (64)

Python Programming: Data Structures and Functions

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

Data Structures: Tuples, Sets, Dictionaries

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

Tuples, Sets, and Dictionaries

Covers tuples, sets, and dictionaries in Python, explaining their similarities and differences, common operations, and key concepts.

Python Programming: List Comprehensions and Higher Order Functions

Explores advanced Python programming concepts, focusing on list comprehensions and higher order functions.

Python Programming: Dictionaries and Classes