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:

Chalens kuiz Algoritma

Yes or No

Played 16

About this activity

Test your algorithm knowledge with true/false picks.

Created by

Indonesia

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
Chalens kuiz Algoritma
 

Chalens kuiz AlgoritmaOnline version

Test your algorithm knowledge with true/false picks.

by Sa Ya
1

The worst-case time of binary search is O(log n).

2

An algorithm is a finite sequence of unambiguous instructions.

3

Dijkstra's algorithm finds the shortest paths from a source to all nodes with non-negative weights.

4

Bubble sort has an average time complexity of O(n).

5

A linear search can only work on sorted data.

6

Binary search requires a sorted array to work correctly.

7

QuickSort average time complexity is O(n log n).

8

A hash table has a worst-case search time of O(1) for every operation.

9

Merge sort uses O(1) extra space in all implementations.

10

Dijkstra's algorithm can handle negative edge weights.

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.