Search Header Logo

Informatika XII

Authored by FIRDIA AMINAH

Computers

12th Grade

Used 4+ times

Informatika XII
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Bagian tree yang berisi nilai tertentu dan dihubungkan oleh sebuah edge adalah ....

root

child node

node

leaf node

subtree

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Hash table menggunakan konsep pencarian data menggunakan elemen dari sebuah

Data yang ada

Graf

Tree

Indeks pada array

Mod

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Terdapat 3 operasi dasar pada BST, kecuali

Insert

Tree

Delete

search

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Gambar berikut merupakan ....

Node

Edge

Parent node

Subtree

Internal node

5.

LABELLING QUESTION

1 min • 6 pts

Berikan label pada tree

d
e
f
c

Node

Edge

Sibling

Root

Subtree

Leaf node

6.

LABELLING QUESTION

1 min • 10 pts

Susunlah Nilai 20,14,40,8,15,30,7 berikut kedalam BST

d
e
f
g
h
i
j

50

30

7

20

14

8

15

40

17

70

7.

FILL IN THE BLANKS QUESTION

30 sec • 5 pts

Media Image

Graf . . .

(a)  

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Microsoft

Continue with Microsoft

or continue with

Facebook

Facebook

Apple

Apple

Others

Others

Already have an account?