Test1

Froggy Jumps

Parties jouées 0

Créer une copie

À propos de cette activité

Takrorlash uchun

Créé par

Shaxzoda Qobilova

Uzbekistan

Téléchargez la version pour jouer sur papier

Top 10 résultats

Il n'y a toujours pas de résultats pour ce jeu. Soyez le premier à apparaître dans le classement! Connectez-vous pour vous identifier.

Créez votre propre jeu gratuite à partir de notre créateur de jeu

Affrontez vos amis pour voir qui obtient le meilleur score dans ce jeu

Créer un défi

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.
Phlebotomy Order of Draw Quiz

Pamela Chapman

United States

(59)

Test your knowledge of the order of draw in Phlebotomy with these 10 questions!
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.
The Integumentary System

Breanna Nesbitt

United States

(58)

Functions and Structures of the skin
pizza

Lorelay Tyana

Romania

(260)

joc despre pizza

		%
	Anonyme	%
		%
		%

Imprimez votre jeu

Test1


Froggy Jumps Test1Version en ligne Takrorlash uchun par 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

Vous pouvez intégrer le jeu dans un LMS compatible avec LTI 1.1 ou LTI 1.3 comme Canvas, Moodle ou Blackboard. Les scores seront ainsi automatiquement enregistrés dans le carnet de notes de la plateforme.

Test1

Froggy Jumps

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

Froggy Jumps

Bill of Rights Game - The Constitutionalist

Froggy Jumps

Phlebotomy Order of Draw Quiz

Froggy Jumps

Ethos, Pathos, and Logos Quiz

Froggy Jumps

The Integumentary System

Froggy Jumps

pizza

Froggy Jumps

Test1Version en ligne

par 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?