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:

Algorithm Essentials Quiz

Froggy Jumps

Played 0

About this activity

Test your algorithm knowledge.

Created by

Saudi Arabia

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
Algorithm Essentials Quiz
 

Froggy Jumps

Algorithm Essentials QuizOnline version

Test your algorithm knowledge.

by Renad Sultan
1

Which data structure is typically used for implementing a priority queue?

2

What is the average time complexity of binary search on a sorted array?

3

Dijkstra's algorithm is used to find what in a graph?

4

Which sorting algorithm has average O(n log n) time and in-place sorting?

5

What data structure is ideal for depth-first search in graphs?

6

Big-O notation describes what aspect of an algorithm?

7

Which algorithm solves the single-source shortest path problem with negative weights but no negative cycles?

8

Which graph algorithm computes all-pairs shortest paths efficiently for dense graphs?

9

Which technique uses a divide-and-conquer approach to sort?

10

Dynamic programming is best described as solving problems by:

Are you sure you want to leave the page?

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