PYTHON DASTURLASH TILIDA MASSIVLARNI TANLASH USULI BILAN SARALASHNI OʻQITISH METODIKASI

Authors

  • Fathiddinov Saidmaʼruf Lazizxoʻja oʻgʻli Osiyo xalqaro universiteti “Aniq fanlar va raqamli texnologiyalar” kafedrasi oʻqituvchisi

Keywords:

Python, massiv, roʻyxat, saralash, tanlash usuli bilan saralash, algoritm murakkabligi, PRIMM, kuzatuv jadvali, dasturlashni oʻqitish metodikasi.

Abstract

 Maqolada “Python dasturlash tili asoslari” kursida massivlarni (roʻyxatlarni) tanlash usuli bilan saralash algoritmini oʻqitish metodikasi taklif etiladi. Metodika PRIMM (bashorat qil – ishga tushir – tekshir – oʻzgartir – yarat) yondashuviga tayanadi va besh bosqichdan iborat: kartochkalar yordamida algoritmni qoʻlda bajarish, kuzatuv jadvalini toʻldirish va natijani bashorat qilish, kodni bosqichma-bosqich yozish, dastur bajarilishini vizualizatsiya qilish va avtomatik testlash, algoritm murakkabligini tahlil qilib boshqa usullar bilan taqqoslash. Maqolada algoritmning Python tilidagi namunaviy dasturi, bajarilish jadvali, talabalarda koʻp uchraydigan xatolar va ularni bartaraf etish yoʻllari, saralash usullarining qiyosiy tavsifi hamda pedagogik tajriba rejasi bayon etilgan.

References

1. Oʻzbekiston Respublikasi Prezidentining 2020-yil 5-oktabrdagi PF-6079-son Farmoni. “Raqamli Oʻzbekiston – 2030” strategiyasini tasdiqlash va uni samarali amalga oshirish chora-tadbirlari toʻgʻrisida.

2. Knuth D.E. The Art of Computer Programming. Vol. 3: Sorting and Searching. 2nd ed. – Reading, MA: Addison-Wesley, 1998. – 780 p.

3. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms. 4th ed. – Cambridge, MA: MIT Press, 2022. – 1312 p.

4. Wing J.M. Computational thinking // Communications of the ACM. – 2006. – Vol. 49, No. 3. – P. 33–35.

5. Sentance S., Waite J., Kallia M. Teaching computer programming with PRIMM: a sociocultural perspective // Computer Science Education. – 2019. – Vol. 29, No. 2–3. – P. 136–176.

6. Bell T., Witten I.H., Fellows M. CS Unplugged: An enrichment and extension programme for primary-aged students. – Christchurch: University of Canterbury, 2015.

7. Lister R., Adams E.S., Fitzgerald S., et al. A multi-national study of reading and tracing skills in novice programmers // ACM SIGCSE Bulletin. – 2004. – Vol. 36, No. 4. – P. 119–150.

8. Parsons D., Haden P. Parson’s programming puzzles: a fun and effective learning tool for first programming courses // Proceedings of the 8th Australasian Conference on Computing Education. – 2006. – Vol. 52. – P. 157–163.

9. Guo P.J. Online Python Tutor: embeddable web-based program visualization for CS education // Proceedings of the 44th ACM Technical Symposium on Computer Science Education (SIGCSE ’13). – 2013. – P. 579–584.

10. Hundhausen C.D., Douglas S.A., Stasko J.T. A meta-study of algorithm visualization effectiveness // Journal of Visual Languages and Computing. – 2002. – Vol. 13, No. 3. – P. 259–290.

11. Sorva J. Notional machines and introductory programming education // ACM Transactions on Computing Education. – 2013. – Vol. 13, No. 2. – Article 8.

12. Hake R.R. Interactive-engagement versus traditional methods: A six-thousand-student survey of mechanics test data for introductory physics courses // American Journal of Physics. – 1998. – Vol. 66, No. 1. – P. 64–74.

Downloads

Published

2026-11-11

Conference Proceedings Volume

Section

Articles

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.