JARAYONNING XOTIRA MURAKKABLIGI
Keywords:
xotira murakkabligi, funksiya, qoldiqli rekursiv funksiya, qoldiqsiz rekursiv funksiya, maydon, sinf, tuzilmaAbstract
Ushbu maqola xotirani moslashtirish va to'ldirishning sinflar va tuzilmalar kabi ma'lumotlar tuzilmalarining xotira murakkabligiga ta'sirini o'rganadi. Xotiraning murakkabligiga maydonlar turi va soni, moslashtirish talablari va xotiraga kirishni optimallashtirish uchun kompilyator tomonidan kiritilgan to'ldirish kabi omillar ta'sir qiladi. Hizalama unumdorlikni oshirsa-da, chegara cheklovlarini qondirish uchun to'ldirishni qo'shish orqali qo'shimcha xotira yukini kiritadi. Matematik formulalar xotira murakkabligi maydon turlari, to'ldirish va tilga xos bo'lgan qo'shimcha xarajatlar asosida qanday hisoblanganligini ko'rsatish uchun ishlatiladi. Ushbu omillarni tushunish algoritmni loyihalash va optimallashtirishda xotirani yanada samarali boshqarish imkonini beradi.
References
Levitin, Anany. Introduction to the design & analysis of algorithms / Anany Levitin. — 3rd ed. Muminov B. B., Kh E. Modelling asynchronous parallel process with Petri net //International Journal of Engineering and Advanced Technology (IJEAT). – 2019. – Т. 8. – С. 400-405.
Мўминов Б. Б. и др. МЕТОДЫ И АЛГОРИТМЫ ВВОДА, РЕДАКТИРОВАНИЯ И СОХРАНЕНИЯ ДАННЫХ НА ПЛАТФОРМЕ IS-ICT //Евразийский Союз Ученых. – 2019. – №. 9-1 (66).
Kushwah S. P. S., Rawat K., Gupta P. Analysis and comparison of efficient techniques of clustering algorithms in data mining //International Journal of Innovative Technology and Exploring Engineering (IJITEE). – 2012. – Т. 1. – №. 3.
Hofman T., Dai C. H. Energy efficiency analysis and comparison of transmission technologies for an electric vehicle //2010 IEEE vehicle power and propulsion conference. – IEEE, 2010. – С. 1-6.
Kanade T. et al. Cell image analysis: Algorithms, system and applications //2011 IEEE Workshop on Applications of Computer Vision (WACV). – IEEE, 2011. – С. 374-381.
Knuth, D. E. (1976). The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.
Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
Cook, S. A. (1971). The complexity of theorem-proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing (pp. 151–158). ACM.
Rowley, J.E. (1993). Information systems methodologies: A review and assessment of their applicability to the selection, design and implementation of library and information systems. Journal of Information Science, 19(4), 291-301.
Armstrong, D. & Hardgrave, B. (2007). Understanding mindshift learning: The transition to object-oriented development," MIS Quarterly, 31(3).
Zhao, L. & Siau, K. (2002). Component-based development using UML. Communications of the Association for Information Systems, 9, 207-222.
Erickson, J. & Siau, K. (2008). Web services, service oriented computing, and service oriented architecture: Separating hype from reality. Journal of Database Management, 19(3), 42-54.
Erickson, J., Lyytinen, K., & Siau, K. (2005). Agile modeling, agile software development, and extreme programming: The state of research. Journal of Database Management, 16(4), 88-100.
Siau, K. & Tan, X. (2005a). Improving the quality of conceptual modeling using cognitive mapping techniques. Data And Knowledge Engineering, 55(3), 343-365.
Wei, C., Chiang, R., & Wu, C. (2006). Accommodating individual preferences in the categorization of documents: A personalized clustering approach. Journal of Management Information Systems, 23(2), 2006, 173-201.
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Muxamadiyev Sanjar Isoyevich, Mo‘minov Bahodir Boltayevich
This work is licensed under a Creative Commons Attribution 4.0 International License.
