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 Estructuras de Datos

Yes or No

Played 49

About this activity

Responde Yes/No sobre conceptos clave de estructuras.

Created by

El Salvador

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 Estructuras de Datos
 

Desafío de Estructuras de DatosOnline version

Responde Yes/No sobre conceptos clave de estructuras.

by German Isaias Martinez Jiménez
1

Una cola (FIFO) devuelve el primer elemento que entró.

2

Una lista enlazada permite acceso aleatorio en O(1).

3

Un árbol binario de búsqueda mantiene el orden de clave para búsquedas eficientes.

4

Una tabla hash asocia claves con valores mediante una función de hash.

5

Una lista doblemente enlazada permite insertar y eliminar en O(1) usando punteros.

6

Una tabla hash perfecta evita todas las colisiones.

7

Un árbol AVL no se reequilibra tras inserciones.

8

Los grafos dirigidos siempre son acíclicos.

9

Una pila puede crecer automáticamente sin reasignación de memoria.

10

Un arreglo dinámico puede recomponerse para expandirse cuando se llena.

Are you sure you want to leave the page?

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