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:

Desafío de Algoritmos

Yes or No

Played 0

About this activity

Quiz rápido sobre conceptos de algoritmos

Created by

Mexico

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
Desafío de Algoritmos
 

Desafío de AlgoritmosOnline version

Quiz rápido sobre conceptos de algoritmos

by Esmeralda Nuñez Nuñez
1

Un algoritmo de búsqueda binaria funciona en listas desordenadas eficientemente.

2

Un algoritmo siempre debe ejecutarse en memoria contigua.

3

Un algoritmo no puede tener múltiples soluciones para un mismo problema.

4

Los algoritmos pueden ser representados mediante diagramas de flujo, pseudocódigo o lenguaje de programación.

5

Un algoritmo es un conjunto de pasos finitos para resolver un problema.

6

Un algoritmo en pseudocódigo no debe ser legible para humanos.

7

Un algoritmo puede ser equivalente a otro si realiza la misma tarea y produce el mismo resultado para todas las entradas.

8

La notación Big O describe la complejidad temporal o espacial de un algoritmo.

9

Un algoritmo debe ser determinista, es decir, debe producir la misma salida para la misma entrada.

10

La complejidad temporal O(n^2) es siempre peor que O(n) en todas las situaciones.

Are you sure you want to leave the page?

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