New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Quiz : Algorithmes de Navigation et Optimisation de Trajets

Quiz

Played 2

About this activity

Testez vos connaissances sur les algorithmes de navigation et d'optimisation de trajets.

Created by

United States

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Quiz : Algorithmes de Navigation et Optimisation de Trajets
 

Quiz : Algorithmes de Navigation et Optimisation de TrajetsOnline version

Testez vos connaissances sur les algorithmes de navigation et d'optimisation de trajets.

by Séléna DUTEURTRE | 202
1

Quel algorithme est couramment utilisé pour trouver le plus court chemin dans un graphe pondéré sans poids négatifs ?

2

Quel est le rôle principal d’une heuristique dans l’algorithme A ?

3

Le problème du voyageur de commerce (TSP) est un exemple de :

4

Quel algorithme est efficace pour résoudre approximativement le TSP ?

5

Quel algorithme construit un arbre couvrant minimal, utile en navigation de réseau ?

6

Lequel des algorithmes suivants donne tous les plus courts chemins entre toutes les paires de nœuds ?

7

Quelle est la principale limitation de l’algorithme Dijkstra ?

8

Quel est l’avantage principal d’un algorithme glouton pour l’optimisation de trajet ?

9

Quel type d’algorithme est l’algorithme de Dijkstra ?

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.