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:

Formal metodlar va algoritmlar: Rekursiya va Mashinalar

Yes or No

Played 0

About this activity

Algoritmlarni tasniflash usullari haqida savollar

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
Formal metodlar va algoritmlar: Rekursiya va Mashinalar
 

Formal metodlar va algoritmlar: Rekursiya va MashinalarOnline version

Algoritmlarni tasniflash usullari haqida savollar

by Aydana Ikramova
1

Rekursiv ta’riflar graaf algoritmlarini tasvirlash uchun ishlata olmaydi.

2

Rekursiv shakllar bazaviy holat va rekursiv qadam orqali algoritmlarni ifodalay olish imkonini beradi.

3

Normal shakllarning maqsadi har doim ifodalarni uzunlashtirishdir.

4

Rekursiv yondashuvlar faqat rekursiv algoritmlar uchun mos, sikl yozilishi mumkin emas.

5

Algoritmlarning normal shakllari ifodalarni iloji boricha oddiylashtirishga qaratilgan.

6

Turing mashinasi faqat o‘ngga harakat qiladi, chapga harakat qilish mumkin emas.

7

Formal metodlar algoritmlarni tavsiflashda rekursiv tavsiflardan foydalanishni o‘z ichiga oladi.

8

Turing mashinasi cheklangan holatlar to‘plami, o‘tkazish maydoni (tape) va boshni o‘qish-yozish orqali ishlaydi.

9

Turing mashinasi har qanday hisoblanishi mumkin bo‘lgan funksiyani simulyatsiya qila oladi.

10

Formal metodlar har doim probabilistik kafolatlar talab qiladi.

Are you sure you want to leave the page?

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