Data Structures Quiz

Test

Parties jouées 0

Créer une copie

À propos de cette activité

DS Fundamentals Quiz

Créé par

Dr. G Kalyani, Associate Professor, Dept of IT

India

Téléchargez la version pour jouer sur papier

Top 10 résultats

Il n'y a toujours pas de résultats pour ce jeu. Soyez le premier à apparaître dans le classement! Connectez-vous pour vous identifier.

Créez votre propre jeu gratuite à partir de notre créateur de jeu

Affrontez vos amis pour voir qui obtient le meilleur score dans ce jeu

Créer un défi

		%
	Anonyme	%
		%
		%

Imprimez votre jeu

Data Structures Quiz


Data Structures QuizVersion en ligne DS Fundamentals Quiz par 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.

Vous pouvez intégrer le jeu dans un LMS compatible avec LTI 1.1 ou LTI 1.3 comme Canvas, Moodle ou Blackboard. Les scores seront ainsi automatiquement enregistrés dans le carnet de notes de la plateforme.

Data Structures Quiz

Test

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

Test

Tissues - Practice Quiz

Test

Spanish Alphabet Listening

Test

UPS 5 Seeing Habits Quiz

Test

Practice Quiz - Punnett Square, Variation, and Mutations

Test

Photosynthesis vs Cellular Respiration - Practice Quiz

Data Structures QuizVersion en ligne

par 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