Code Clash: Two-Team Programming Quiz

Froggy Jumps

Jugadas 0

Crear copia

Sobre esta actividad

Two-team tech duel

Creada por

Rayan Alamri

Omán

Descarga la versión para jugar en papel

Top 10 resultados

Todavía no hay resultados para este juego. ¡Sé el primero en aparecer en el ranking! Inicia sesión para identificarte.

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

Crear reto

Sabiduría animal

Educaplay Educational Resources

España

(15298)

Conviértete en un genio del Reino Animal
Quiz de Culpa mía película

Yamila Chavez

Argentina

(170)

Demuestra cuánto sabes sobre la película Culpa mía con este divertido quiz.
El valle de los lobos

Marcos Signes

España

(107)

20 preguntas de este maravilloso libro
OPEN UP 6 UNIT 1 VOCABULARY

karen blixen

España

(97)

Repasamos el vocabulario de la unidad
Salva a la Ranita

Melanie Rodriguez

Estados Unidos

(334)

Contesta las siguientes multiplicaciones correctamente para salvar a la ranita y evitar que caiga al agua, mucha suerte!


Froggy Jumps Code Clash: Two-Team Programming QuizVersión en línea Two-team tech duel por Rayan Alamri 1 Which sorting algorithm is stable and divides the list to merge sorted parts? a Merge sort b Heap sort c Quick sort 2 What is the primary purpose of a hash table in programming? a Uses fixed memory b Average O(1) lookups c Maintains order 3 Which algorithm finds the shortest path in graphs with non-negative weights? a Kruskal’s algorithm b Bellman-Ford c Dijkstra’s algorithm 4 Which paradigm focuses on pure functions and avoids side effects? a Functional programming b Object-oriented programming c Imperative programming 5 In Git, which command creates a new branch? a git merge b git branch c git checkout 6 What best defines a deadlock in concurrent systems? a One process starves others b Resource free and unlocked c Mutual waiting with circular dependency 7 In a balanced BST, what is the typical time complexity for insert/search? a O(n^2) b O(log n) c O(1) 8 What is the time complexity of searching a randomly ordered unsorted array? a O(log n) b O(1) c O(n)

Froggy Jumps

Code Clash: Two-Team Programming QuizVersión en línea

Two-team tech duel

por Rayan Alamri

Which sorting algorithm is stable and divides the list to merge sorted parts?

Merge sort

Heap sort

Quick sort

What is the primary purpose of a hash table in programming?

Uses fixed memory

Average O(1) lookups

Maintains order

Which algorithm finds the shortest path in graphs with non-negative weights?

Kruskal’s algorithm

Bellman-Ford

Dijkstra’s algorithm

Which paradigm focuses on pure functions and avoids side effects?

Functional programming

Object-oriented programming

Imperative programming

In Git, which command creates a new branch?

git merge

git branch

git checkout

What best defines a deadlock in concurrent systems?

One process starves others

Resource free and unlocked

Mutual waiting with circular dependency

In a balanced BST, what is the typical time complexity for insert/search?

O(n^2)

O(log n)

O(1)

What is the time complexity of searching a randomly ordered unsorted array?

O(log n)

O(1)

O(n)

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.

Code Clash: Two-Team Programming Quiz

Froggy Jumps

Sobre esta actividad

Creada por

Descarga la versión para jugar en papel

Top juegos

Froggy Jumps

Sabiduría animal

Froggy Jumps

Quiz de Culpa mía película

Froggy Jumps

El valle de los lobos

Froggy Jumps

OPEN UP 6 UNIT 1 VOCABULARY

Froggy Jumps

Salva a la Ranita

Froggy Jumps

Code Clash: Two-Team Programming QuizVersión en línea

por Rayan Alamri

Which sorting algorithm is stable and divides the list to merge sorted parts?

What is the primary purpose of a hash table in programming?

Which algorithm finds the shortest path in graphs with non-negative weights?

Which paradigm focuses on pure functions and avoids side effects?

In Git, which command creates a new branch?

What best defines a deadlock in concurrent systems?

In a balanced BST, what is the typical time complexity for insert/search?

What is the time complexity of searching a randomly ordered unsorted array?

		%
	Anónimo	%
		%
		%