satr algoritmlari

PPTX 80 pages 19.2 MB Free download

80 pages

FaylHub.uz

Download via Telegram

Size 19.2 MB

File type PPTX

Pages 80

Updated Dec 2025

Page preview (5 pages)

Scroll down 👇

1 / 80

satr algoritmlari. satr algoritmlari. satr masalalarini orientrlangan graf masalalariga olib kelish. string? bizga summa o’zgaruvchisi berilgan. u o’zida barcha alfavitlar to’plamini saqlasin. ∑=(a,b,c, … , x,w,z). a qatori ∑* ning istalgan elementi hisoblanib, ushbu ∑ ning 0 yoki undan ortiq elementlaridan iborat har qanday ketma-ketlikdir. ‘bu satr tipidagi ma’lumot’ ∑* ‘shuningdek bu ham satr’ ∑* ‘1234’ ∑* think’s!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! string operatorlari bizga s1 va s2 satrlar berilgan bo’lsin. mos ravishda uzunliklari n va m bo’lsin. tenglik: s1=s2? o’rinlimi? (mumkin bo’lgan holatlarni ko’ramiz) ‘bu satr tipidagi ma’lumot’ = ‘bu satr tipidagi ma’lumot’ ‘bu satr tipidagi ma’lumot’ ≠ ‘bu boshqa tipdagi ma’lumot’ ‘bu satr tipidagi ma’lumot’ =? ‘bu satr tipidagi ma’lumot’ ishlash vaqti n eng qisqa matn uzunligi bo’lsa: o(n) string operatorlari s1s2 stringlarni o’zaro birlashtiramiz. ‘bu’,’satr’ → ‘bu satr’ ishlash vaqti (yangi string hosil qilamiz deb hisoblang) ө(n+m) string operatorlari almashtirish: muayyan belgining barcha takrorlanishlarini boshqa belgi bilan o’zaro almashtirish subsititute (‘bu …

2 / 80

ing(s, 1, i) suffiks: suffix(s,i) = substring(s, i+1, length(n)) masofa(levenshtein masofasi)ni tahrirlash ikki satr orasidagi masofani o’lchash s1 satrni s2 satrga o’zgartirish uchun zarur bo'lgan qo'shimchalar, o’chirish ishlari va almashtirishlarning eng kam sonidir. joylashtirish: misol: misol: misol: misol: masofani oʻnglash nima uchun bu foydali bo'lishi mumkin? tahrir masofasi simmetrikmi? ya’ni edit(s1,s2) = edit(s2,s1) ? edit(simple, apple) =? edit(apple,simple) nima uchun? sub ‘i’ , ‘j’ ga  sub ‘j’ , ‘i’ ga delete ‘i’  insert ‘i’ ga insert ‘i’  delete ‘i’ ga mos amal hisoblanadi tahrirlash masofasini hisoblash g’oyalar? tahrirlash masofasini hisoblash barcha mumkin bo’lgan operatsiyalardan so'ng x ni y bilan tenglashtirish kerak insert insert delete delete substitution substitution konbinatsiya natijasi: kombinatsiya natijasi running time satrli moslik uzunligi m ning namuna string p va s uzunlikdagi n qatorini hisobga olsak, p ning s da sodir bo'ladigan barcha joylarini topamiz foydalanish grep/egrep search find java.lang.string.contains() sodda usullar bilan tanishamiz to'g'rimi …

3 / 80

.png image26.png image27.png image28.png image29.png image30.png image31.png image32.png image33.png image34.png image35.png image36.png image37.png image38.png image39.png image40.png image41.png image42.png image43.png image44.png image45.png image46.png image47.png image48.png image49.png image50.png image51.png image52.png image53.png image54.png image55.png image56.png image57.png image58.png image59.png image60.png image61.png image62.png image63.png image72.png image73.png image74.png image64.png image65.png image66.png image67.png image68.png image69.png image70.png image71.png image75.png image76.png image77.png image78.png image79.png image80.png image81.png image82.png image83.png image84.png image85.png image86.png image87.png image88.png image89.png image90.png image91.png image92.png image93.png image94.png image95.png image96.png image97.png image98.png image99.png image100.png image1.png /docprops/thumbnail.jpeg

4 / 80

5 / 80

Want to read more?

Download all 80 pages for free via Telegram.

Download full file

About "satr algoritmlari"

satr algoritmlari. satr algoritmlari. satr masalalarini orientrlangan graf masalalariga olib kelish. string? bizga summa o’zgaruvchisi berilgan. u o’zida barcha alfavitlar to’plamini saqlasin. ∑=(a,b,c, … , x,w,z). a qatori ∑* ning istalgan elementi hisoblanib, ushbu ∑ ning 0 yoki undan ortiq elementlaridan iborat har qanday ketma-ketlikdir. ‘bu satr tipidagi ma’lumot’ ∑* ‘shuningdek bu ham satr’ ∑* ‘1234’ ∑* think’s!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! string operatorlari bizga s1 va s2 satrlar berilgan bo’lsin. mos ravishda uzunliklari n va m bo’lsin. tenglik: s1=s2? o’rinlimi? (mumkin bo’lgan holatlarni ko’ramiz) ‘bu satr tipidagi ma’lumot’ =...

This file contains 80 pages in PPTX format (19.2 MB). To download "satr algoritmlari", click the Telegram button on the left.

Tags: satr algoritmlari PPTX 80 pages Free download Telegram