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:

Parcial Estructura de datos

Quiz

Played 21

About this activity

estructuras de selección

Created by

Colombia

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
Parcial Estructura de datos
 

Parcial Estructura de datosOnline version

estructuras de selección

by ELIBERTO HOYOS
1

El anterior código pertenece a un método de búsqueda ¿a cual?

2

El siguiente código nos muestra un método de ordenamiento a ¿cual corresponde?

3

Este algoritmo resuelve el problema de ordenar una secuencia de números de forma creciente ¿ De que método estamos hablando?

4

La lista enlazada la cual no apunta a null y forma un bucle es conocida como:

5

consiste en un conjunto de nodos enlazados. Cada nodo contiene dos apuntadores, que son referencias al nodo siguiente y al anterior en la secuencia de nodos. El enlace al nodo anterior del primer nodo y el enlace al nodo siguiente del último nodo, apuntan a un tipo de nodo que marca el final de la lista.