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 Strategi Algoritmik K11

Quiz

Played 0

About this activity

Kuis strategi algoritmik untuk SMA K11

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 Strategi Algoritmik K11
 

Kuis Strategi Algoritmik K11Online version

Kuis strategi algoritmik untuk SMA K11

by YOAN FREDYANTO
1

Apa syarat utama rekursi dalam sebuah fungsi?

2

Sifat apa yang dipakai oleh pendekatan greedy?

3

Tujuan utama masalah knapsack 0/1?

4

Definisi pemrograman dinamik yang tepat?

5

Contoh klasik rekursi?

6

Masalah greedy sering efektif jika memenuhi apa?

7

Apa perbedaan utama 0/1 knapsack dengan unbounded knapsack?

8

Keuntungan utama DP dibanding rekursi biasa?

9

Masalah contoh DP bottom-up yang umum?

10

Apa risiko utama rekursi tanpa kasus dasar yang jelas?

Feedback

Tanpa kasus dasar, rekursi bisa tidak berhenti.

Greedy memilih solusi lokal terbaik dulu.

Kapasitas adalah pembatas utama, nilai dioptimalkan.

DP menggunakan memoization atau bottom-up.

Faktorial sering dipakai contoh rekursi sederhana.

Greedy bekerja jika setiap langkah lokal optimal berujung pada solusi global optimal.

Pembatasan jumlah pengambilan item berbeda.

DP menyimpan hasil submasalah untuk referensi ulang.

Fibonnaci bisa dipecahkan bottom-up dengan tabulasi.

Tanpa kasus dasar, rekursi bisa tak berujung.

Are you sure you want to leave the page?

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