Formalization of Data Derivative Structures
Rustam Vosilovich kabulovPhD, Department of Software engineering, Tashkent University of Information Technologies named after Muhammad al-Khwarizimi, Tashkent, Republic of UzbekistanOrtik RuzibaevPhD, Department of Software engineering, Tashkent University of Information Technologies named after Muhammad al-Khwarizimi, Tashkent, Republic of UzbekistanKuchkorov Temur AtaxanovichPhD, Department of Software engineering, Tashkent University of Information Technologies named after Muhammad al-Khwarizimi, Tashkent, Republic of UzbekistanSanjar Saidqulovich Muminovdepartment of System and Application Programming of Tashkent University of Information Technologies named after Muhammad al-Khwarizmi, Senior Lecturer, Tashkent, Republic of Uzbekistan
2020 International Conference on Information Science and Communications Technologies (ICISCT)conference2020en
ABI
Аннотация
The paper considers the topical issue of formal description of data structures. Data structures are widely used in modern object-oriented programming to solve various practical problems. The paper introduces functions for performing operations with such data structures as stack, queue, and priority queue. The conditions that these functions must satisfy are introduced as axioms. To describe the axioms, an approach based on an abstract data type, algebraic and programmatic approaches were used.
Мавзулар
Идентификаторлар
Иқтибослар ва манбалар
0 та иқтибос12 та фойдаланилган манба
Кўрсаткичлар — AkademScholar · Тез орада