Crear
Descargar
Obtener Plan Académico
Compartir juego
Intégralo en tu plataforma

Puedes integrar el juego en un LMS compatible con LTI 1.1 o LTI 1.3 como Canvas, Moodle, o Blackboard. De esta manera podrás guardar las puntuaciones automáticamente en el libro de calificaciones de esa plataforma.
Descargar
Has superado el número máximo de juegos que puedes integrar en Google Classroom con tu Plan actual.

Para integrar tantos juegos como quieras en Google Classroom, necesitas un Plan Académico o un Plan Comercial.

Has superado el número máximo de juegos que puedes integrar en Microsoft Teams con tu Plan actual.

Para integrar tantos juegos como quieras en Microsoft Teams, necesitas un Plan Académico o un Plan Comercial.

La descarga de juegos es una característica exclusiva para usuarios con un Plan Académico o un Plan Comercial.

Obtén ahora tu Plan Académico o Comercial y comienza a integrar tus juegos en tu LMS, web o blog.

Si lo deseas, puedes descargar un juego de prueba aquí y probar su integración:

Guess the Code

Test

Jugadas 1

Sobre esta actividad

Code-themed image quiz

Creada por

Argelia

Descarga la versión para jugar en papel

Crea tu propio juego gratis desde nuestro creador de juegos
Compite contra tus amigos para ver quien consigue la mejor puntuación en esta actividad

Top juegos

%
Anónimo
Anónimo
%
%
%
Has superado el número máximo de juegos que puedes imprimir con tu Plan actual.

Para imprimir tantos juegos como quieras, necesitas un Plan Académico o un Plan Comercial.

Imprime tu juego
Guess the Code
 

Guess the CodeVersión en línea

Code-themed image quiz

por sidra REG
1

Minecraft screenshot: which data structure is best for world chunk management in real-time rendering?

2

Among Us crewmate with pathfinding overlay: which algorithm is commonly used for NPC navigation?

3

Tetris pieces arranged on screen: which data structure is perfect for a stack-like Tetris line clearing process?

4

YouTube interface showing recommended videos: which sorting algorithm is often used in ranking items by score?

5

Pac-Man maze with pellets: which algorithm is classic for grid-based pathfinding?

6

Google Maps navigation screen: which graph algorithm computes shortest routes?

7

Photoshop-like editor showing layers: which data structure models layers for rendering order?

8

Fortnite build mode screenshot: which technique renders distant terrain efficiently?

9

Instagram feed with polished thumbnails: which caching strategy speeds repeated image loads?

10

Python shell icon: which language emphasizes readability and simple syntax?

11

GitHub repo with commits: which data structure underpins the version history?

12

Google Chrome tabs: which algorithm helps prioritize which tab to unload first?

13

CUDA kernel launch visualization: which parallel computing concept is key for GPU ops?

14

YouTube buffering icon: which technique hides latency using prefetching?

15

Roblox scene with collision outlines: which collision detection method is common in games?

16

Fortnite weapon upgrade screen: which data structure suits inventory with quick add/remove?

17

Cuphead boss fight image: which algorithm handles sprite-level animation timing?

18

Reddit thread with upvotes: which concept ranks items by score efficiently?

19

Unity editor screenshot: which design pattern helps decouple components?

20

Minecraft redstone circuit image: which algorithm models signal propagation?

21

Google Cloud Console: which programming paradigm scales horizontally across machines?

22

Steam achievements page: which technique ensures fair unlocks across sessions?

23

Code editor autocomplete: which data structure underpins fast prefix queries?

24

Stack Overflow logo: which algorithm helps detect similar questions?

25

Discord chat: which protocol underpins real-time messaging?

Feedback

Octrees help quickly cull unseen chunks, improving rendering performance in 3D worlds.

A* efficiently finds shortest paths using heuristics, ideal for game AI navigation.

A stack naturally supports last-in, first-out behavior for piece operations.

QuickSort is a common efficient sort for large datasets used in ranking.

BFS guarantees shortest path in unweighted grids like mazes.

Dijkstra finds shortest path from a source to all nodes efficiently on maps.

A stack naturally preserves top-to-bottom rendering order.

LOD adapts geometry complexity with distance to optimize performance.

LRU keeps recently used items ready, reducing load times.

Python is praised for clean syntax and rapid prototyping.

Git history forms a DAG of commits to avoid cycles.

LRU prioritizes keeping recently accessed tabs in memory.

SIMD processes multiple data points with the same instruction across threads.

Prefetching estimates future needs to smooth playback.

AABB is fast for broad-phase collision checks.

Hash maps offer O(1) average lookup for items.

Tweening smooths transitions between keyframes in animations.

Heaps allow quick access to the highest-scored item.

Observers get notified about changes without tight coupling.

Modeling redstone as a graph clarifies propagation paths.

Parallelism spreads work across multiple cores/nodes.

Idempotent operations produce same result even if repeated.

Tries optimize matching common code prefixes.

Cosine similarity measures text similarity in high-dim spaces.

WebSocket enables full-duplex real-time communication.

¿Seguro que quieres abandonar la página?

Si sales, perderás la partida en curso.