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:

Algoritmlar bo‘yicha quiz

Quiz

Played 0

About this activity

Algoritm tushunchasi va turlari

Created by

Uzbekistan

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
Algoritmlar bo‘yicha quiz
 

Algoritmlar bo‘yicha quizOnline version

Algoritm tushunchasi va turlari

by Tursunoy Allamova
1

Algoritm nima? Xulosaga yetishuvchi aniq ketma-ket qadamlar to‘plamidir.

2

O(n) murakkablik nima ifodalaydi? Qaysi funksiya kabi qiymatga yaqinlashadi.

3

Saralash algoritmlaridan biri bo‘lgan quicksort qaysi nuqtada ishlaydi?

4

Dinamik dasturlash nima? Qanday muammolar uchun samarali bo‘ladi?

5

Rekursiya nima?

6

Tayanch ma’lumot tuzilmasi sifatida qaysi biri ko‘proq navbatga mos keladi?

7

Algoritm majmullari uchun o‘rinli numiralash qaysi fazada muhim?

8

Greedy algoritmi qanday prinsip bilan ishlaydi?

9

Big-O notationi nima anglatadi?

10

Bubble sort algoritmi haqida nima to‘g‘ri?

Feedback

Algoritm aniq boshlanish/bitish nuqtalari va yondashuvlarni belgilaydi.

O(n) – massiv hajmi bilan bevosita bog‘liq o‘sishni anglatadi.

Quicksort pivot atamasidan foydalanib, rekursiya orqali bo‘linadi.

Dasturlashda takrorlanadigan qismi oldindan hisoblab, qayta ishlatadi.

Rekursiya funksiyaning o‘zini o‘ziga chaqirishi bilan ishlaydi.

Navbatda elementlar FIFO tartibida tutiladi.

To‘g‘ri bosqichlar algoritmni aniq bajarish uchun zarur.

Greedy yondashuv har bir qadamda eng yaxshi ko‘rinadigan variantni tanlaydi.

Big-O dastur uchun vaqt yoki xotira sarfini keng miqyosda tasvirlaydi.

Bubble sortda bosqichma-bosqich eng katta element yuqori holga chiqadi.

Are you sure you want to leave the page?

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