Test1

Froggy Jumps

Played 0

Create copy

About this activity

Takrorlash uchun

Created by

Shaxzoda Qobilova

Uzbekistan

Download the paper version to play

Top 10 results

There are still no results for this game. Be the first to stay in the ranking! Log in to identify yourself.

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

The Integumentary System

Breanna Nesbitt

United States

(58)

Functions and Structures of the skin
Ethos, Pathos, and Logos Quiz

Kristine Vester

United States

(131)

Test your knowledge of ethos, pathos, and logos with these 10 questions on examples of persuasive techniques.
Phlebotomy Order of Draw Quiz

Pamela Chapman

United States

(59)

Test your knowledge of the order of draw in Phlebotomy with these 10 questions!
Bill of Rights Game - The Constitutionalist

Doni The Don

United States

(89)

Test your knowledge on the Bill of Rights. A fun way to test your knowledge and focus on where you need to improve.
pizza

Lorelay Tyana

Romania

(258)

joc despre pizza


Froggy Jumps Test1Online version Takrorlash uchun by Shaxzoda Qobilova 1 Chekli avtomatning asosiy vazifasi nima? a Ma'lumotlarni saqlash va tahrirlash b Berilgan satr (so‘z) ma'lum bir tilga tegishli ekanligini aniqlash c Murakkab matematik tenglamalarni yechish 2 Chekli avtomat nechta elementdan iborat kortej (to‘plam) orqali tavsiflanadi? a 3 ta b 4 ta c 5 ta ($Q, \Sigma, \delta, q_0, F$) 3 Deterministik chekli avtomatda (DFA) bitta holatdan ma'lum bir simvol orqali nechta holatga o‘tish mumkin? a Faqat bitta b Kamida ikkita c Istalgancha 4 Deterministik (DFA) va Nodeterministik (NFA) chekli avtomatlarning farqi nimada? a DFA ko‘proq xotira talab qiladi b NFAda bitta simvol uchun bir nechta keyingi holat mavjud bo‘lishi mumkin c DFA faqat raqamlar bilan ishlaydi 5 Avtomatning "qabul qiluvchi holatlari" (Final states) odatda grafikda qanday tasvirlanadi? a Kvadrat ichida b Ikki qavatli aylana bilan c Chiziqli strelka bilan 6 Chekli avtomatlar qaysi turdagi tillarni taniy oladi? a Kontekstdan ozod tillarni b Rekursiv tillarni c Muntazam (Regular) tillarni 7 "Pustoy" (bo‘sh) o‘tishlar ($\epsilon$-transitions) qaysi turdagi avtomatlarga xos? a DFA b NFA c Faqat Turing mashinasi 8 Chekli avtomatda xotira qanday ko‘rinishda bo‘ladi? a Cheksiz katta xotira mavjud b Xotira faqat chekli miqdordagi "holatlar" ko‘rinishida bo‘ladi c Tashqi disk xotirasi ishlatiladi 9 Agar avtomat barcha simvollarni o‘qib bo‘lgandan keyin "Final" (yakuniy) holatda bo‘lsa, u holda satr... a Rad etilgan (Rejected) hisoblanadi b Qabul qilingan (Accepted) hisoblanadi c Xato deb hisoblanadi 10 Muntazam ifodalarni (Regular Expressions) chekli avtomatga aylantirish mumkinmi? a Ha, har qanday muntazam ifoda uchun DFA yoki NFA qurish mumkin b Yo‘q, muntazam ifodalar ancha murakkab c Faqat raqamli ifodalarni aylantirib bo‘ladi

Froggy Jumps

Test1Online version

Takrorlash uchun

by Shaxzoda Qobilova

Chekli avtomatning asosiy vazifasi nima?

Ma'lumotlarni saqlash va tahrirlash

Berilgan satr (so‘z) ma'lum bir tilga tegishli ekanligini aniqlash

Murakkab matematik tenglamalarni yechish

Chekli avtomat nechta elementdan iborat kortej (to‘plam) orqali tavsiflanadi?

3 ta

4 ta

5 ta ($Q, \Sigma, \delta, q_0, F$)

Deterministik chekli avtomatda (DFA) bitta holatdan ma'lum bir simvol orqali nechta holatga o‘tish mumkin?

Faqat bitta

Kamida ikkita

Istalgancha

Deterministik (DFA) va Nodeterministik (NFA) chekli avtomatlarning farqi nimada?

DFA ko‘proq xotira talab qiladi

NFAda bitta simvol uchun bir nechta keyingi holat mavjud bo‘lishi mumkin

DFA faqat raqamlar bilan ishlaydi

Avtomatning "qabul qiluvchi holatlari" (Final states) odatda grafikda qanday tasvirlanadi?

Kvadrat ichida

Ikki qavatli aylana bilan

Chiziqli strelka bilan

Chekli avtomatlar qaysi turdagi tillarni taniy oladi?

Kontekstdan ozod tillarni

Rekursiv tillarni

Muntazam (Regular) tillarni

"Pustoy" (bo‘sh) o‘tishlar ($\epsilon$-transitions) qaysi turdagi avtomatlarga xos?

DFA

NFA

Faqat Turing mashinasi

Chekli avtomatda xotira qanday ko‘rinishda bo‘ladi?

Cheksiz katta xotira mavjud

Xotira faqat chekli miqdordagi "holatlar" ko‘rinishida bo‘ladi

Tashqi disk xotirasi ishlatiladi

Agar avtomat barcha simvollarni o‘qib bo‘lgandan keyin "Final" (yakuniy) holatda bo‘lsa, u holda satr...

Rad etilgan (Rejected) hisoblanadi

Qabul qilingan (Accepted) hisoblanadi

Xato deb hisoblanadi

Muntazam ifodalarni (Regular Expressions) chekli avtomatga aylantirish mumkinmi?

Ha, har qanday muntazam ifoda uchun DFA yoki NFA qurish mumkin

Yo‘q, muntazam ifodalar ancha murakkab

Faqat raqamli ifodalarni aylantirib bo‘ladi

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.

Test1

Froggy Jumps

About this activity

Created by

Download the paper version to play

Top Games

Froggy Jumps

The Integumentary System

Froggy Jumps

Ethos, Pathos, and Logos Quiz

Froggy Jumps

Phlebotomy Order of Draw Quiz

Froggy Jumps

Bill of Rights Game - The Constitutionalist

Froggy Jumps

pizza

Froggy Jumps

Test1Online version

by Shaxzoda Qobilova

Chekli avtomatning asosiy vazifasi nima?

Chekli avtomat nechta elementdan iborat kortej (to‘plam) orqali tavsiflanadi?

Deterministik chekli avtomatda (DFA) bitta holatdan ma'lum bir simvol orqali nechta holatga o‘tish mumkin?

Deterministik (DFA) va Nodeterministik (NFA) chekli avtomatlarning farqi nimada?

Avtomatning "qabul qiluvchi holatlari" (Final states) odatda grafikda qanday tasvirlanadi?

Chekli avtomatlar qaysi turdagi tillarni taniy oladi?

"Pustoy" (bo‘sh) o‘tishlar ($\epsilon$-transitions) qaysi turdagi avtomatlarga xos?

Chekli avtomatda xotira qanday ko‘rinishda bo‘ladi?

Agar avtomat barcha simvollarni o‘qib bo‘lgandan keyin "Final" (yakuniy) holatda bo‘lsa, u holda satr...

Muntazam ifodalarni (Regular Expressions) chekli avtomatga aylantirish mumkinmi?

		%
	Anonymous	%
		%
		%