Lecture

Interaction Model Design Explanation

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

CS-107: Introduction to programming

Ce cours aborde les concepts fondamentaux de la programmation et de la programmation orientée objet (langage JAVA). Il permet également de se familisarier avec un environnement de développement informatique (par défaut sous Unix). ...

Description

This lecture explains the design model for managing interactions in a mini-project where small games are programmed with actors interacting. The instructor provides insights on categorizing actors into interactors and interactables, defining specific methods for each, and delegating interaction management to a specific handler class. The lecture emphasizes the importance of minimizing code modifications when adding new actors by delegating interaction management to a specific handler class. It also covers the implementation of interaction methods for interactors and interactables, ensuring that interactions are managed efficiently and effectively.

Instructors (2)

Jamila Sam

Jamila Sam is currently senior researcher and lecturer at the Ecole Polytechnique Fédérale de Lausanne (Switzerland).

Rafael Pereira Pires

Official source

Related concepts (6)

Program optimization

In computer science, program optimization, code optimization, or software optimization, is the process of modifying a software system to make some aspect of it work more efficiently or use fewer resources. In general, a computer program may be optimized so that it executes more rapidly, or to make it capable of operating with less memory storage or other resources, or draw less power. Although the word "optimization" shares the same root as "optimal", it is rare for the process of optimization to produce a truly optimal system.

Optimizing compiler

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution time, memory footprint, storage size, and power consumption (the last three being popular for portable computers). Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources or executes faster.

Object code optimizer

An object code optimizer, sometimes also known as a post pass optimizer or, for small sections of code, peephole optimizer, forms part of a software compiler. It takes the output from the source language compile step - the object code or - and tries to replace identifiable sections of the code with replacement code that is more algorithmically efficient (usually improved speed). The earliest "COBOL Optimizer" was developed by Capex Corporation in the mid 1970s for COBOL.

Peephole optimization

Peephole optimization is an optimization technique performed on a small set of compiler-generated instructions; the small set is known as the peephole or window. Peephole optimization involves changing the small set of instructions to an equivalent set that has better performance.

Interprocedural optimization

Interprocedural optimization (IPO) is a collection of compiler techniques used in computer programming to improve performance in programs containing many frequently used functions of small or medium length. IPO differs from other compiler optimizations by analyzing the entire program as opposed to a single function or block of code. IPO seeks to reduce or eliminate duplicate calculations and inefficient use of memory and to simplify iterative sequences such as loops.

Related lectures (59)

OLAP Queries and Optimizations

Covers OLAP queries, examples of comparisons, ranking, and optimizations for query performance.

Optimizing Recursive Queries

Explores optimizing recursive queries in database systems using Datalog and semirings, discussing the challenges and solutions in data analytics.

Compiler Extension Lab

Covers the Compiler Extension Lab, focusing on adding new functionality to a simple functional language compiler.

Code Optimization: Speeding-up Analyses

Explores techniques to speed up dataflow analyses and discusses the importance of node ordering and post-order traversal.

Debugging and Optimization