Data Structures Quiz

Test

Jugadas 0

Crear copia

Sobre esta actividad

DS Fundamentals Quiz

Creada por

Dr. G Kalyani, Associate Professor, Dept of IT

India

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

Brawl stars preguntas

Carlos Andrés Prieto Rodríguez

Colombia

(164)

Completa todas las preguntas
Tipos de sintagmas (II)

idoia rubio

España

(945)

Actividades interactivas para reconocer los distintos tipos de sintagmas
Verbos irregulares en Inglés

Hélmer González Serrano

Colombia

(309)

Se presentan 10 preguntas, cada una con 4 opciones de respuesta. Seleccione la que considere correcta.
Cultura general española

Ernest Serret

España

(100)

Responde las siguientes preguntas
cuanto sabes de Futbol

hugo estay

Chile

(316)

este test esta basado en las diapositivas que pudimos ver con anterioridad, consta de 10 preguntas las cuales tienen alternativas para poder resolverlas.

		%
	Anónimo	%
		%
		%

Imprime tu juego

Data Structures Quiz


Data Structures QuizVersión en línea DS Fundamentals Quiz por Dr. G Kalyani, Associate Professor, Dept of IT 1 Which data structure is LIFO (last in, first out)? a Linked List b Binary Tree c Stack d Queue 2 Which operation adds an element to the end of a queue? a Enqueue b Push c Pop d Append 3 In a singly linked list, what pointer connects a node to the next node? a Head pointer b Data pointer c Prev pointer d Next pointer 4 In a binary search tree, how are keys arranged relative to the root? a All left keys are less than the root; right keys are greater b Keys are in random order c All keys are equal to the root d Left keys are greater, right keys are less 5 What is the average time complexity to search in a balanced BST? a O(log n) b O(n log n) c O(1) d O(n) 6 What is a collision in a hash table? a A key is not found during lookup b A hash value is negative c A key maps to a different table d Two keys hash to the same index 7 Which data structure provides FIFO behavior? a Stack b Queue c Tree d Graph 8 Which data structure allows constant-time random access by index? a Queue b Linked List c Stack d Array 9 What operation adds a node at the beginning of a linked list? a Delete head b Append c Insert at end d Prepend (or push to head) 10 Which traversal of a BST yields keys in sorted order? a In-order traversal b Level-order traversal c Post-order traversal d Pre-order traversal Feedback 1 Stacks follow LIFO: the last item pushed is the first popped. 2 Enqueue adds to the rear; dequeue removes from the front. 3 Each node typically has a next pointer to the following node. 4 BSTs place lesser keys to the left and greater keys to the right of a node. 5 Balanced BSTs allow logarithmic search time on average. 6 Collisions occur when different keys map to the same bucket. 7 Queues process elements in the order they were added (first in, first out). 8 Arrays support direct indexing for O(1) access. 9 Prepending places a new node before the current head. 10 In-order traversal of a BST visits nodes in ascending key order.

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.

Data Structures Quiz

Test

Sobre esta actividad

Creada por

Descarga la versión para jugar en papel

Top juegos

Test

Brawl stars preguntas

Test

Tipos de sintagmas (II)

Test

Verbos irregulares en Inglés

Test

Cultura general española

Test

cuanto sabes de Futbol

Data Structures QuizVersión en línea

por Dr. G Kalyani, Associate Professor, Dept of IT

Which data structure is LIFO (last in, first out)?

Which operation adds an element to the end of a queue?

In a singly linked list, what pointer connects a node to the next node?

In a binary search tree, how are keys arranged relative to the root?

What is the average time complexity to search in a balanced BST?

What is a collision in a hash table?

Which data structure provides FIFO behavior?

Which data structure allows constant-time random access by index?

What operation adds a node at the beginning of a linked list?

Which traversal of a BST yields keys in sorted order?

Feedback