{"id":6387,"date":"2023-09-26T09:07:54","date_gmt":"2023-09-26T09:07:54","guid":{"rendered":"https:\/\/texnokun.uz\/?p=6387"},"modified":"2023-09-26T09:07:56","modified_gmt":"2023-09-26T09:07:56","slug":"intervyu-amaliyoti-uchun-5-ta-python-dasturlari","status":"publish","type":"post","link":"https:\/\/texnokun.uz\/?p=6387","title":{"rendered":"Intervyu amaliyoti uchun 5 ta Python dasturlari"},"content":{"rendered":"\n

Python dunyodagi eng mashhur dasturlash tillardan biri\u0123a aylandi. Sababi: uni o’rganish oson, foydalanish imkoniyatlari keng va uning rivojlanishiga hissa qo’shadigan juda ko’p dasturchilar hamjamiyatiga ega. Agar siz Python intervyusiga tayyorgarlik ko’rayotgan bo’lsangiz, o’z fikrlash tarzingizga ega bo’lishingiz uchun ba’zi dasturlash muammolarini mashq qilganingiz ma’qul.<\/p>\n\n\n\n

\n
\"\"<\/figure>\n<\/figure>\n\n\n\n

Foydalanishingiz mumkin bo’lgan <\/font><\/font>5 ta Python dasturlari:<\/font><\/font><\/strong><\/p>\n\n\n\n

1.Fibonachchi ketma-ketligi<\/font><\/font><\/strong><\/p>\n\n\n\n

Rekursiya yordamida Fibonachchi ketma-ketligini yozish uchun Python dasturini yozing:<\/em><\/font><\/font><\/p>\n\n\n\n

Fibonachchi ketma-ketligi – bu har bir raqam oldingi ikkita raqamning yig’indisi bo’lgan raqamlar qatoridir. Seriyadagi birinchi ikkita raqam 0 va 1 dir.<\/p>\n\n\n\n

Python’da rekursiya yordamida Fibonachchi ketma-ketligini yaratish uchun biz ”n” butun sonini kirish sifatida qabul qiladigan va ketma-ketlikdagi ”n” sonni qaytaradigan rekursiv funksiyani aniqlashimiz mumkin. Masalan:<\/p>\n\n\n\n

<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
def fibonachchi (n): <\/span><\/span>\n  <\/span>if<\/span> n <= 0: <\/span><\/span>\n    return <\/span>0<\/span>     <\/span><\/span>\n  elif n == 1:<\/span><\/span>\n    return <\/span>1<\/span>     <\/span><\/span>\n  <\/span>else<\/span> : fibonachchi(n - 1) + fibonachchi(n - 2)<\/span><\/span><\/code><\/pre>BAT<\/span><\/div>\n\n\n\n
Buni amalda biz birinchi navbatdagi “n” ning 0 dan kichik yoki teng<\/font><\/font><\/font><\/font>ligini tekshiramiz. Agar t\u00f3g’ri bo’lsa, biz ketma-ketlikdagi birinchi raqam bo’lgan 0 ni qaytaramiz. Agar “n” 1 ga teng bo’lsa, biz ketma-ketlikdagi raqam bo’lgan 1 ni qaytaramiz. Aks holda, fibonachchi funksiyasini “n-1” va “n-2” bilan rekursiv argument sifatida chaqiramiz va uni ketma-ketlikdagi ‘n’ sonni olish uchun qo’shamiz.<\/font><\/font><\/font><\/font><\/p>\n\n\n\n
Funksiyani sinab ko’rish uchun biz uni “n” ning turli qiymatlari bilan chaqirishimiz mumkin:<\/em><\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
>>> fibonachchi(0)<\/span><\/span>\n0<\/span><\/span>\n>>> fibonachchi(1)<\/span><\/span>\n1<\/span><\/span>\n>>> fibonachchi(10)<\/span><\/span>\n55<\/span><\/span>\n>>> fibonachchi(20)<\/span><\/span>\n6765<\/span><\/span><\/code><\/pre>BAT<\/span><\/div>\n\n\n\n
Yodda saqlang, ushbu dastur eksponensial vaqt murakkabligiga ega, ya’ni “n” ning katta qiymatlari uchun u juda sekin ishlashi mumkin. Agar siz “n” ning katta qiymatlari uchun Fibonachchi ketma-ketligini yaratishingiz kerak bo’lsa, uning o’rniga kreativ yondashuv yoki yodlangan rekursiv yondashuvdan foydalanishni ko’rib chiqishingiz mumkin.<\/p>\n\n\n\n
2. Palindrom tekshiruvi<\/strong><\/p>\n\n\n\n
Berilgan satr palindrom yoki yo’qligini tekshirish uchun Python dasturini yozing<\/em>:<\/p>\n\n\n\n
Palindrom – bu bir xil oldinga va orqaga o’qiladigan so’z, raqam yoki boshqa belgilar ketma-ketligi. Misol uchun, “353” soni yoki “aka” s\u00f3zi palindromdir, chunki ular oldinga va orqaga bir xil o’qiladi.<\/font><\/font><\/p>\n\n\n\n
Pythonda berilgan satr palindrom tekshiruv uchun satr kirishga qabul qilinadi va agar satr palindrom bo’lsa, True, aks holda False aniqlashni qaytaradigan funksiyani aniqlashimiz mumkin. Masalan:<\/font><\/font><\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
def<\/span> <\/span>is_palindrome<\/span>(<\/span>s<\/span>):<\/span><\/span>\n  <\/span>return<\/span> s == s[::-<\/span>1<\/span>]<\/span><\/span><\/code><\/pre>Python<\/span><\/div>\n\n\n\n
Ushbu amalda te<\/font><\/font>st satrni biz satrni tuzatish va uni asl satr bilan solishtirish uchun Python<\/font><\/font>‘ning kesish sintaksisidan foydalanamiz. Agar ular teng bo’lsa, funksiya True’ni qaytaradi; aks holda, u False’ni qaytaradi.<\/font><\/font><\/p>\n\n\n\n
Funksiyani sinab ko’rish uchun biz uni turli qatorlar bilan chaqirishimiz mumkin:<\/p>\n\n\n\n
\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
>>> is_palindrome(<\/span>"353"<\/span>)  <\/span><\/span>\nTrue<\/span><\/span>\n>>> is_palindrome(<\/span>"salom"<\/span>) <\/span><\/span>\nFalse  <\/span><\/span>\n>>> is_palindrome(<\/span>"12321"<\/span>) <\/span><\/span>\nTrue<\/span><\/span><\/code><\/pre>BAT<\/span><\/div>\n\n\n\n
Unutmang, ushbu dastur tizimini satrida faqat harf-raqamli belgilar (harflar va raqamlar) mavjud bo’lsa amalga oshirish mumkin. Agar kirish satrida boshqa vositalar (masalan, bo’shliqlar, tinish belgilar yoki maxsus belgilar) bo’lishi mumkin bo’lsa, ularni to’g’ri boshqarish uchun dasturni o<\/font><\/font>‘zgartirishingiz kerak bo’lishi mumkin.<\/font><\/font><\/p>\n\n\n\n
3. Bosh sonni tekshirish<\/strong><\/p>\n\n\n\n
Berilgan son tub yoki yo\u2018qligini tekshirish uchun Python dasturini yozing<\/em>:<\/p>\n\n\n\n
Tub son 1 dan katta bo\u02bblgan musbat butun son bo\u02bblib, 1 va o\u02bbzidan boshqa musbat butun son bo\u02bbluvchilari yo\u02bbq. Masalan, 2, 3, 5, 7, 11 va 13 tub sonlardir.<\/p>\n\n\n\n
Pythonda berilgan son tub ekanligini tekshirish uchun biz ”n” butun sonini kirish sifatida qabul qiladigan va agar ”n” tub bo\u2018lsa True, aks holda False qiymatini qaytaradigan funksiyani aniqlashimiz mumkin. Masalan:<\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
def<\/span> <\/span>is_prime<\/span>(<\/span>n<\/span>):  <\/span><\/span>\n  <\/span>if<\/span> n <= <\/span>1<\/span>:       <\/span><\/span>\n    <\/span>return<\/span>  <\/span>False<\/span><\/span>\n  <\/span>elif<\/span> n == <\/span>2<\/span>:<\/span><\/span>\n    <\/span>return<\/span> <\/span>True<\/span><\/span>\n  <\/span>else<\/span>:<\/span><\/span>\n    <\/span>for<\/span> i <\/span>in<\/span> <\/span>range<\/span>(<\/span>2<\/span>, <\/span>int<\/span>(n** <\/span>0.5<\/span>) + <\/span>1<\/span>):<\/span><\/span>\n      <\/span>if<\/span> n % i == <\/span>0<\/span>:          <\/span><\/span>\n        <\/span>return<\/span> <\/span>False<\/span><\/span>\n      <\/span>else<\/span>:         <\/span><\/span>\n        <\/span>return<\/span> <\/span>True<\/span><\/span><\/code><\/pre>Python<\/span><\/div>\n\n\n\n
Buni amalga <\/font><\/font>oshirishda biz birinchi navbatda “n” ning 1dan kichik yoki teng ekanligini tekshiramiz.<\/font><\/font><\/p>\n\n\n\n
Agar shunday bo’lsa, biz False  qaytaramiz, chunki 1 tub son emas. Agar “n” 2 ga teng bo’lsa, biz True’ni qaytaramiz, chunki 2 yagona juft tub sondir. Aks holda, 2 dan “n” ning kvadrat ildizigacha (eng yaqin butun songa yaxlitlangan) butun sonlarni takrorlash uchun for siklidan foydalanamiz.<\/font><\/font><\/p>\n\n\n\n
Ushbu diapazondagi har bir “i” butun soni uchun “n” ning “i” ga bo’linishini tekshiramiz. Agar shunday bo’lsa, biz False’ni qaytaramiz, chunki “n” ning 1 va o’zidan boshqa musbat butun son bo’luvchiga ega. Agar biz diapazondagi barcha butun sonlarni musbat bo’luvchini topmasdan tekshirib ko’rgan bo’lsak, biz True deb qaytaramiz, chunki “n” tub sondir.<\/font><\/font><\/p>\n\n\n\n
Funksiyani sinab ko’rish uchun biz uni “n” ning turli qiymatlari bilan chiqarishimiz mumkin:<\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
>>> is_prime( <\/span>1<\/span> )<\/span><\/span>\nFalse <\/span><\/span>\n>>> is_prime( <\/span>2<\/span> )<\/span><\/span>\nTrue  <\/span><\/span>\n>>> is_prime( <\/span>3<\/span> )<\/span><\/span>\nTrue  <\/span><\/span>\n>>> is_prime( <\/span>4<\/span> )<\/span><\/span>\nFalse  <\/span><\/span>\n>>> is_prime( <\/span>17<\/span> )  <\/span><\/span>\nTrue  <\/span><\/span>\n>>> is_prime( <\/span>100<\/span> )<\/span><\/span>\nFalse<\/span><\/span><\/code><\/pre>BAT<\/span><\/div>\n\n\n\n
4. Faktorial kalkulyator<\/strong><\/p>\n\n\n\n
Rekursiya yordamida berilgan sonning faktorialini hisoblash uchun Python dasturini yozing<\/em>:<\/p>\n\n\n\n
Manfiy bo’lmagan ”n” butun sonning faktoriali “n” dan kichik yoki teng barcha musbat sonlarning ko’paytmasidir. Masalan, 5 ning faktoriali 5 * 4 * 3 * 2 * 1 = 120.<\/p>\n\n\n\n
Pythonda rekursiya yordamida berilgan sonning faktorialini <\/font><\/font>hisoblash uchun biz “n” butunini kirish sifatida qabul qilish va “n” ning faktorialini qayta tiklash funksiyasini boshqarishimiz mumkin. Mana bir misol amalga oshirish:<\/font><\/font><\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
def<\/span> <\/span>faktorial<\/span>(<\/span>n<\/span>):    <\/span><\/span>\n  <\/span>if<\/span> n == <\/span>0<\/span> :<\/span><\/span>\n    <\/span>return<\/span> <\/span>1<\/span><\/span>\n  <\/span>else<\/span>:<\/span><\/span>\n    <\/span>return<\/span> n * faktorial(n-<\/span>1<\/span>)     <\/span><\/span><\/code><\/pre>Python<\/span><\/div>\n\n\n\n
Buni amal<\/font><\/font>ga oshirishda biz birinchi navbatda “n” ning 0 ga tengligini tekshiramiz. Agar shunday bo’lsa, biz 1 ni qaytaramiz, chunki 0 ning faktoriali 1 bo’lishi aniqlangan. Aks holda, biz “n-1” bilan faktorial funksiyani kirish sifatida rekursiv chaqiramiz va ko’paytiramiz. “n” ning faktorialini olish uchun natija “n” ga teng.<\/font><\/font><\/p>\n\n\n\n
Funksiyani sinab ko’rish uchun biz uni “n” ning turli qiymatlari bilan chiqarishimiz mumkin:<\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
>>> faktorial( <\/span>0<\/span> ) <\/span><\/span>\n1<\/span>  <\/span><\/span>\n>>> faktorial ( <\/span>1<\/span> )  <\/span><\/span>\n1<\/span> <\/span><\/span>\n>>> faktorial ( <\/span>5<\/span> ) <\/span><\/span>\n120<\/span>  <\/span><\/span>\n>>> faktorial ( <\/span>10<\/span> )  <\/span><\/span>\n3628800<\/span><\/span><\/code><\/pre>BAT<\/span><\/div>\n\n\n\n
Unutmang, ushbu dastur O(n) vaqt murakkabligiga ega, ya’ni u “n” ning katta <\/font><\/font>qiymatlari uchun juda sekin ishlashi mumkin. <\/font><\/font><\/p>\n\n\n\n
5. Anagramma tekshiruvi:<\/strong> berilgan ikkita satr bir-birining anagrammasi ekanligini tekshirish uchun Python dasturini yozing.<\/p>\n\n\n\n
Anagramma – bu boshqa so’z yoki iboraning harflarini o’<\/font><\/font>zgartirish orqali  hosil bo’lgan so’z yoki ibora, barcha asl harflarni bir marta ishlatadi. <\/font><\/font><\/p>\n\n\n\n
Python da berilgan ikkita satr bir-birining anagrammasi ekanligini bilish uchun biz ikkita satrni kirish orqali qabul qilamiz<\/font><\/font> va agar satrlar anagramma bo’lsa, True, aks holda False javoblarini qaytaradigan funksiyani aniqlashimiz mumkin. Mana bir misol amalga oshirish:<\/font><\/font><\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
def<\/span> <\/span>is_anagram<\/span>(<\/span>s1<\/span>,<\/span>s2<\/span>):  <\/span><\/span>\n  <\/span>return<\/span> sort(s1) == sort(s2)<\/span><\/span><\/code><\/pre>Python<\/span><\/div>\n\n\n\n
Ushbu amaliyotda bir satrdagi qoidalarni saralash va tartiblangan satrlarni solishtirish uchun Python’ning o’z<\/font><\/font>garishida biz tartiblangan funksiyasidan foydalanamiz. Agar ular teng bo’lsa, funksiya True’ni qaytaradi: aks holda, u False’ni qaytaradi.<\/font><\/font><\/p>\n\n\n\n
Funksiyani sinab ko’rish uchun biz uni turli qatorlar bilan chaqirishimiz mumkin:<\/p>\n\n\n\n
<\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
>>> is_anagram ( <\/span>"listen"<\/span> , <\/span>"silent"<\/span> )<\/span><\/span>\nTrue<\/span><\/span>\n>>> is_anagram ( <\/span>"hello"<\/span> , <\/span>"world"<\/span> )<\/span><\/span>\nFalse<\/span><\/span>\n>>> is_anagram ( <\/span>"restful"<\/span> , <\/span>"fluster"<\/span> )<\/span><\/span>\nTrue<\/span><\/span><\/code><\/pre>BAT<\/span><\/div>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
Agar siz Python intervyusiga tayyorgarlik ko’rayotgan bo’lsangiz, o’z fikrlash tarzingizga ega bo’lishingiz uchun ba’zi dasturlash muammolarini mashq qilganingiz ma’qul<\/p>\n","protected":false},"author":17,"featured_media":9003,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_mi_skip_tracking":false,"footnotes":""},"categories":[14],"tags":[11,108],"class_list":["post-6387","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-dasturlash","tag-dasturlash","tag-python"],"_links":{"self":[{"href":"https:\/\/texnokun.uz\/index.php?rest_route=\/wp\/v2\/posts\/6387","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/texnokun.uz\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/texnokun.uz\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/texnokun.uz\/index.php?rest_route=\/wp\/v2\/users\/17"}],"replies":[{"embeddable":true,"href":"https:\/\/texnokun.uz\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=6387"}],"version-history":[{"count":7,"href":"https:\/\/texnokun.uz\/index.php?rest_route=\/wp\/v2\/posts\/6387\/revisions"}],"predecessor-version":[{"id":9065,"href":"https:\/\/texnokun.uz\/index.php?rest_route=\/wp\/v2\/posts\/6387\/revisions\/9065"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/texnokun.uz\/index.php?rest_route=\/wp\/v2\/media\/9003"}],"wp:attachment":[{"href":"https:\/\/texnokun.uz\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=6387"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/texnokun.uz\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=6387"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/texnokun.uz\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=6387"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}