Stack Data Structure Quiz

Froggy Jumps

Parties jouées 0

Créer une copie

À propos de cette activité

Test your knowledge of stacks.

Créé par

Work

Iraq

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


Froggy Jumps Stack Data Structure QuizVersion en ligne Test your knowledge of stacks. par Work 1 Which operation returns the top element without removing it? a pop() b push() c peek() 2 Stack Overflow occurs when: a Stack empty b top == -1 c top == capacity – 1 3 Which implementation allows dynamic resizing? a Linked List b Queue c Array 4 In a linked-list implementation, the pointer top refers to: a Random node b First node (most recent) c Last node 5 Time complexity of pop() is: a O(log n) b O(1) c O(n) 6 Question 11a: What value is popped? a 30 b 10 c 20 7 Question 11b: What value does peek() return? a 20 b 10 c 30 8 Question 11c: Final stack content (top → bottom). a 20, 10 b 10, 20 c 30, 20, 10 9 Question 12a: List all popped values in order. a 9, 7 b 9, 11 c 11, 9 10 Question 12b: What does peek() return? a 11 b 15 c 9 11 Question 12c: Final stack content (top → bottom). a 7, 5, 15 b 15, 5, 7 c 15, 7, 5 12 Question 13a: What are the popped values? a 1, 3 b 1, 4 c 4, 1 13 Question 13b: What does peek() return? a 4 b 3 c 2 14 Question 13c: Final stack content (top → bottom). a 3, 2 b 2, 3 c 3, 2, 1

Froggy Jumps

Stack Data Structure QuizVersion en ligne

Test your knowledge of stacks.

par Work

Which operation returns the top element without removing it?

pop()

push()

peek()

Stack Overflow occurs when:

Stack empty

top == -1

top == capacity – 1

Which implementation allows dynamic resizing?

Linked List

Queue

Array

In a linked-list implementation, the pointer top refers to:

Random node

First node (most recent)

Last node

Time complexity of pop() is:

O(log n)

O(1)

O(n)

Question 11a: What value is popped?

Question 11b: What value does peek() return?

Question 11c: Final stack content (top → bottom).

20, 10

10, 20

30, 20, 10

Question 12a: List all popped values in order.

9, 7

9, 11

11, 9

Question 12b: What does peek() return?

Question 12c: Final stack content (top → bottom).

7, 5, 15

15, 5, 7

15, 7, 5

Question 13a: What are the popped values?

1, 3

1, 4

4, 1

Question 13b: What does peek() return?

Question 13c: Final stack content (top → bottom).

3, 2

2, 3

3, 2, 1

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.

Stack Data Structure Quiz

Froggy Jumps

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

Froggy Jumps

Phlebotomy Order of Draw Quiz

Froggy Jumps

pizza

Froggy Jumps

Ethos, Pathos, and Logos Quiz

Froggy Jumps

Bill of Rights Game - The Constitutionalist

Froggy Jumps

The Integumentary System

Froggy Jumps

Stack Data Structure QuizVersion en ligne

par Work

Which operation returns the top element without removing it?

Stack Overflow occurs when:

Which implementation allows dynamic resizing?

In a linked-list implementation, the pointer top refers to:

Time complexity of pop() is:

Question 11a: What value is popped?

Question 11b: What value does peek() return?

Question 11c: Final stack content (top → bottom).

Question 12a: List all popped values in order.

Question 12b: What does peek() return?

Question 12c: Final stack content (top → bottom).

Question 13a: What are the popped values?

Question 13b: What does peek() return?

Question 13c: Final stack content (top → bottom).

		%
	Anonyme	%
		%
		%