New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Линейни структури данни: Stack & Queue

Froggy Jumps

Played 0

About this activity

Избор на правила за Stack и Queue- Упражнение 11 клас

Created by

Bulgaria
This game is a version of

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Линейни структури данни: Stack & Queue
 

Froggy Jumps

Линейни структури данни: Stack & QueueOnline version

Избор на правила за Stack и Queue- Упражнение 11 клас

by Весела
1

Какa структура от данни спазва принципа LIFO?

2

Коя структура от данни спазва принцип FIFO (първи влязъл, първи излязъл)?

3

Кой метод се използва за добавяне на елемент върха на стека?

4

Кой метод се използва за добавяне на елемент в края на опашката?

5

Кой метод премахва и връща първия елемент от опашката?

6

Кой метод премахва най-горния елемент от стека?

7

С кое свойство проверяваме точния брой на елементите в структурата?

8

Кой метод не позволява да видим кой елемент излиза първи?

9

Ако в празен стек добавим 5, 10 и 15, кое число ще бъде първо при извикване на Pop()?

10

Ако в празна опашка добавим 5, 10 и 15, кое число ще бъде първо при извикване на Dequeue()?

Are you sure you want to leave the page?

If you leave, you will lose the game in progress.