MTA_lecture_7(Sort)
Authored by Dilmurod Tuxtanazarov
Computers
1st - 3rd Grade
Used 60+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
19 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
0 sec • 1 pt
Saralash algoritmlari
Ro'yhatlarni tartiblash
berilgan obyektlar ketma-ketligini ma`lum mantiqiy tartibda qayta joylashtirish jarayoniga aytiladi
Turli hil obektlar ichidan kerakli yozuvlarni saralab olish
2.
MULTIPLE CHOICE QUESTION
0 sec • 1 pt
Saralash jarayoni qanday kechadi ?
tatrtibli joylashtitish orqali tashkil qilinadi
Saralash jarayoni eng katta va kichigini topishga asoslangan jarayon hisoblanadi.
Saralash jarayoni taqqoslashga asoslangan jarayon hisoblanadi.
3.
MULTIPLE CHOICE QUESTION
0 sec • 1 pt
Saralash algoritmlari nima uchun kerak
Kompyuterni tez ishlashi uchun
resurslarni tejash uchun
foydalanuvchi va tizim ish jarayonida qulaylik tashkil qilish uchun
4.
FILL IN THE BLANKS QUESTION
1 min • 1 pt
Array deyarli saralangan bo`lsa eng yaxshi saralash algoritm (a) sort
5.
FILL IN THE BLANKS QUESTION
0 sec • 1 pt
operatsion tizimlarda ham saralashdan foydalaniladimi
Ha -> 1
Yuq -> 0
(a)
6.
MULTIPLE CHOICE QUESTION
0 sec • 1 pt
Bubble sort qanday ishlaydi
tartib bilan ketma-ket yozuvlarni solishtirish orqali saralaydi
tartib bilan eng katta va eng kichigini topish orqali saralaydi
katta va kichiklarni joyini almashtirish orqali saralaydi
7.
MULTIPLE CHOICE QUESTION
0 sec • 1 pt
Bubble sort ......
eng sodda va vaqt ko`p sarflanadigan saralash algoritm
eng sodda va vaqt kam sarflanadigan saralash algoritm
eng murakkab va vaqt ko`p sarflanadigan saralash algoritm
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
