New game
Download
SCORM download
To be used in an LMS (Moodle, Blackboard...)
Regular download
To be published on a website or blog.
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.
Get Academic Plan
If you wish, you can download a demo game here and test its integration:
Share game
Yes or No
Yes or No

Algoritmlar bo‘yicha Qisqa Tekshiruv

Integrate it into your platform
G. Classroom M. Teams
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.

Get Academic 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.

Get Academic 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:

Get Academic Plan

Algoritmlar bo‘yicha Qisqa Tekshiruv

Yes or No

Played 2
Create copy

About this activity

Algoritmlar haqida haqiqat-yolg‘onlarni aniqlang.

Created by

s2_sheyx
s2_sheyx
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
Make challenge

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.

Get Academic Plan
Print your game
Algoritmlar bo‘yicha Qisqa Tekshiruv
 

Algoritmlar bo‘yicha Qisqa TekshiruvOnline version

Algoritmlar haqida haqiqat-yolg‘onlarni aniqlang.

by s2_sheyx
1

Greedy algoritmlari har doim eng sifatli yechim beradi.

2

Dasturlash tillari algoritmlarni ifodalash uchun yuqori darajadagi abstraksiyalarni taqdim etadi.

3

Dynamic programming har doim eng oddiy, eng tez echim bo‘ladi.

4

Time complexity (vaqt murakkabligi) algoritmning samaradorligini o‘lchash uchun asosiy o‘lchovdir.

5

Bir algoritmni yozishda xatolik bo‘lsa, bu natijaga hech qachon ta'sir qilmaydi.

6

Algoritm ma'lum bir kirish qiymatlari uchun yakuniy natija beruvchi qadamlar ketma-ketligidir.

7

Rekursiya mavjud bo‘lmagan algoritmlar mavjud emas, har doim rekursiya bo‘ladi.

8

Algoritm faqat raqamli ma'lumotlar bilan ishlay oladi; matnli ma'lumotlar uchun ishlamaydi.

9

Rekursiya algoritmlaridan ba'zi muammolarni yechishda samarali bo‘ladi va ularning yechimi ko‘pincha rekursiya bilan ifodalanadi.

10

Algoritmlar faqat to‘liq xatolarsiz ishlaydi; amalda xatolar bo‘lishi mumkin emas.

11

Bir xil kirish uchun har doim bir xil chiqish beradi, deyarli deterministik algoritmlar uchun to‘g‘ri.

12

Biror kirish uchun har doim eng qisqa vaqt ichida natija beradigan algoritmlar mavjud bo‘lmasa ham bo‘ladi.

13

Sortlashtirish algoritmlarining barcha turlari O(n^2) vaqt murakkabligiga ega.

 
Are you sure you want to leave the page?

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