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:

Kuis Struktur Data Kelas 9

Yes or No

Played 0

About this activity

Tebak benar salah mengenai struktur data

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
Kuis Struktur Data Kelas 9
 

Kuis Struktur Data Kelas 9Online version

Tebak benar salah mengenai struktur data

by Aulia Azzahrah
1

Queue mengikuti prinsip FIFO (first in, first out).

2

Stack mengikuti prinsip LIFO (last in, first out).

3

Akses elemen acak pada linked list lebih cepat daripada pada array.

4

Pohon biner penuh selalu seimbang.

5

Linked list menyimpan elemen di node terpisah dan dihubungkan dengan referensi.

6

Struktur data utama dalam pemrograman meliputi array, linked list, stack, queue, dan pohon.

7

Hash table tidak pernah mengalami tabrakan (collision).

8

Pohon biner bisa memiliki anak kiri dan kanan.

9

Struktur data antrian tidak bisa digunakan untuk penjadwalan tugas.

10

Graf hanya bisa direpresentasikan dengan matriks adjacency.

Are you sure you want to leave the page?

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