Stacks & Linked Lists Quiz

Froggy Jumps

Parties jouées 0

Créer une copie

À propos de cette activité

Data structures basics

Créé par

Khushi Kumari

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

Stacks & Linked Lists Quiz


Froggy Jumps Stacks & Linked Lists QuizVersion en ligne Data structures basics par Khushi Kumari 1 Which data structure follows Last In, First Out (LIFO) order? a Stack b Linked list c Queue 2 Which operation adds an element to a stack? a Pop b Peek c Push 3 Which operation removes the top element from a stack? a Pop b Top c Push 4 A singly linked list allows traversal in which direction? a From tail to head b From head to tail c In a circle 5 What stores a reference to the first node in a linked list? a Current node b Head pointer c Tail pointer 6 In a stack, which operation returns the top element without removing it? a Pop b Push c Peek (or Top) 7 What is a key advantage of a linked list over an array? a Lower memory usage b Dynamic size c Faster random access 8 Which data structure is best for implementing undo functionality? a Queue b Graph c Stack 9 Which of these is a common drawback of linked lists? a Extra memory for pointers b In-place resizing c Constant-time access 10 Which traversal direction is typical for a singly linked list? a Sequential from head to tail b Backward only c Random access 11 What does LIFO stand for in the context of a stack? a Last In, First Out b Last In, Final Out c First In, Last Out 12 Which operation removes and returns the top element of a stack? a push b pop c peek 13 In a singly linked list, how do you insert a new node at the head? a Set the tail to the new node and disconnect the rest b Update the head to the new node and link it to the old head c Append after the tail 14 Which is an advantage of a stack implemented with a linked list? a Faster access to middle elements b Dynamic size with no fixed capacity c Constant-time random access 15 What is the time complexity of push and pop in a stack implemented with a linked list? a O(log n) b O(n) c O(1) 16 Which operation is most naturally supported by a stack? a Accessing the bottom element quickly b Accessing the top element quickly c Iterating through all elements from head to tail 17 Why might a fixed-size array stack cause overflow? a If more elements are pushed than the array can hold b Because linked lists are used c Because pop removes elements 18 What is the key difference between a stack and a queue? a Stack is LIFO, queue is FIFO b Both are LIFO c Both are FIFO 19 What is the top pointer commonly called in a stack implemented with a linked list? a Tail b Bottom c Top (often called head in code) 20 Name a common real-world use of a stack. a Graph traversal stack-based only b Function call stack or back button navigation c Breadth-first search queue

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.

Stacks & Linked Lists Quiz

Froggy Jumps

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

Froggy Jumps

Bill of Rights Game - The Constitutionalist

Froggy Jumps

The Integumentary System

Froggy Jumps

pizza

Froggy Jumps

Ethos, Pathos, and Logos Quiz

Froggy Jumps

Phlebotomy Order of Draw Quiz

Froggy Jumps

Stacks & Linked Lists QuizVersion en ligne

par Khushi Kumari

Which data structure follows Last In, First Out (LIFO) order?

Which operation adds an element to a stack?

Which operation removes the top element from a stack?

A singly linked list allows traversal in which direction?

What stores a reference to the first node in a linked list?

In a stack, which operation returns the top element without removing it?

What is a key advantage of a linked list over an array?

Which data structure is best for implementing undo functionality?

Which of these is a common drawback of linked lists?

Which traversal direction is typical for a singly linked list?

What does LIFO stand for in the context of a stack?

Which operation removes and returns the top element of a stack?

In a singly linked list, how do you insert a new node at the head?

Which is an advantage of a stack implemented with a linked list?

What is the time complexity of push and pop in a stack implemented with a linked list?

Which operation is most naturally supported by a stack?

Why might a fixed-size array stack cause overflow?

What is the key difference between a stack and a queue?

What is the top pointer commonly called in a stack implemented with a linked list?

Name a common real-world use of a stack.