Lecture

Introducing Advanced Computing Concepts with VPL

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.

Description

This lecture delves into the advanced usage of Thymio and the VPL interface, targeting students over 10 years old with prior experience. Exploring concepts like timers and state variables, the focus is on reading a pedagogical scenario and observing students' implementation of state machines.

In MOOC

The Thymio robot as a tool for discovering digital science

This course is intended for anyone who wants to master the Thymio educational robot, but it is especially designed for primary and secondary school teachers who want to learn about this tool and use it in the classroom. It allows teachers to acquire the basics of computer science and robotics, by proposing adapted problem situations, and by providing pedagogical tracks for the animation in class. It responds to the new programs for the introduction of digital sciences in schools in France and Switzerland an

Official source

Related concepts (11)

Finite-state machine

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.

Moore machine

In the theory of computation, a Moore machine is a finite-state machine whose current output values are determined only by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. Like other finite state machines, in Moore machines, the input typically influences the next state. Thus the input may indirectly influence subsequent outputs, but not the current or immediate output. The Moore machine is named after Edward F.

Mealy machine

In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. This is in contrast to a Moore machine, whose output values are determined solely by its current state. A Mealy machine is a deterministic finite-state transducer: for each state and input, at most one transition is possible. The Mealy machine is named after George H. Mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits".

Procedural programming

Procedural programming is a programming paradigm, derived from imperative programming, based on the concept of the procedure call. Procedures (a type of routine or subroutine) simply contain a series of computational steps to be carried out. Any given procedure might be called at any point during a program's execution, including by other procedures or itself. The first major procedural programming languages appeared circa 1957–1964, including Fortran, ALGOL, COBOL, PL/I and BASIC. Pascal and C were published circa 1970–1972.

Modular programming

Modular programming is a software design technique that emphasizes separating the functionality of a program into independent, interchangeable modules, such that each contains everything necessary to execute only one aspect of the desired functionality. A module interface expresses the elements that are provided and required by the module. The elements defined in the interface are detectable by other modules. The implementation contains the working code that corresponds to the elements declared in the interface.

Related lectures (47)

Aseba Studio Interface Exploration MOOC: The Thymio robot as a tool for discovering digital science

Covers Aseba Studio, a text-based programming environment for Thymio VPL.

LabVIEW Design Patterns

Explores LabVIEW design patterns, covering local and global variables, race conditions, state machines, and producer-consumer architecture.

Distributed Intelligent Systems: Acoustic Field Estimation

Explores acoustic field estimation using wireless sensor networks and discusses challenges in implementing AI techniques in real systems.

Theoretical Properties of RNNs

Explores the theoretical properties and practical power of Recurrent Neural Networks, including their relationship to state machines and Turing completeness.

Handling Command Line Arguments in C: Practical Examples